An Inexact Trust-Region SQP Method with Applications to PDE-Constrained Optimization

  • M. Heinkenschloss
  • D. Ridzal


We present a trust-region sequential quadratic programming (SQP) method with iterative linear system solves, for the solution of smooth nonlinear equality-constrained optimization problems. Stopping criteria for iterative solvers are selected by the optimization algorithm, based on its overall progress. Global convergence is ensured and unnecessary oversolving of linear systems is eliminated. The algorithm is applied to several PDE-constrained optimization problems.


Sequential Quadratic Programming Linear Solver Iterative Solver Augmented System Minimum Norm Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • M. Heinkenschloss
    • 1
  • D. Ridzal
    • 2
  1. 1.Department of Computational and Applied Mathematics, MS-134Rice UniversityHoustonUSA
  2. 2.Optimization and Uncertainty Quantification, MS-1320Sandia National LaboratoriesAlbuquerqueUSA

Personalised recommendations