A sparse superlinearly convergent SQP with applications to two-dimensional shape optimization.
Conference
·
OSTI ID:10738
Discretization of optimal shape design problems leads to very large nonlinear optimization problems. For attaining maximum computational efficiency, a sequential quadratic programming (SQP) algorithm should achieve superlinear convergence while preserving sparsity and convexity of the resulting quadratic programs. Most classical SQP approaches violate at least one of the requirements. We show that, for a very large class of optimization problems, one can design SQP algorithms that satisfy all these three requirements. The improvements in computational efficiency are demonstrated for a cam design problem.
- Research Organization:
- Argonne National Lab., IL (US)
- Sponsoring Organization:
- US Department of Energy (US)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 10738
- Report Number(s):
- ANL/MCS/CP-96123
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints
Superlinear convergence of a stabilized SQP method to a degenerate solution.
Numerical study of a matrix-free trust-region SQP method for equality constrained optimization
Journal Article
·
Thu Jun 15 00:00:00 EDT 2006
· Applied Mathematics and Optimization
·
OSTI ID:21064208
Superlinear convergence of a stabilized SQP method to a degenerate solution.
Journal Article
·
Wed Dec 31 23:00:00 EST 1997
· Comput. Optimization Appl.
·
OSTI ID:937986
Numerical study of a matrix-free trust-region SQP method for equality constrained optimization
Technical Report
·
Wed Nov 30 19:00:00 EST 2011
·
OSTI ID:1038211