Global convergence of inexact reduced sqp methods
- 1 January 1997
- journal article
- other
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 7 (2) , 83-110
Abstract
In this paper we consider infinite dimensional optimization problems with equality constraints. The basic underlying algorithm is a reduced SQP method. We give a global convergence proof in Hilbert space and extend this analysis to inexact reduced SQP methods. These methods are useful when discretizing the infinite dimensional problems and solving the resulting large scale discretized optimization problems. The convergence analysis takes into account the Maratos effect which occurs for nonsmooth norms. The inexact reduced SQP method is applied to a discretized parabolic control problemKeywords
This publication has 16 references indexed in Scilit:
- Projected Sequential Quadratic Programming MethodsSIAM Journal on Optimization, 1996
- An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert SpaceSIAM Journal on Optimization, 1996
- A Reduced Hessian Method for Large-Scale Constrained OptimizationSIAM Journal on Optimization, 1995
- Multilevel Algorithms for Constrained Compact Fixed Point ProblemsSIAM Journal on Scientific Computing, 1994
- Functional and numerical solution of a control problem originating from heat transferJournal of Optimization Theory and Applications, 1991
- An analysis of reduced Hessian methods for constrained optimizationMathematical Programming, 1990
- On the local and global convergence of a reduced Quasi-Newton method1Optimization, 1989
- Diagonally Modified Conditional Gradient Methods for Input Constrained Optimal Control ProblemsSIAM Journal on Control and Optimization, 1986
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization1982