Numerical study of a matrix-free trust-region SQP method for equality constrained optimization.
- Rice University, Houston, TX
This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' [11]. In [11], we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1038211
- Report Number(s):
- SAND2011-9346; TRN: US201208%%581
- Country of Publication:
- United States
- Language:
- English
Similar Records
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
A trust region algorithm for PDE-constrained optimization with bound constraints using reduced order modeling
CONORBIT: constrained optimization by radial basis function interpolation in trust regions
Journal Article
·
2023
· SIAM Journal on Optimization
·
OSTI ID:2311683
A trust region algorithm for PDE-constrained optimization with bound constraints using reduced order modeling
Journal Article
·
2015
· Computer Methods in Applied Mechanics and Engineering
·
OSTI ID:1512909
CONORBIT: constrained optimization by radial basis function interpolation in trust regions
Journal Article
·
2016
· Optimization Methods and Software
·
OSTI ID:1373699