Some examples of cycling in variable metric methods for constrained minimization

DOI10.1007/BF01582123MaRDI QIDQ4187603zbMATH OpenOpenAlexFDO

Authors R. M. Chamberlain

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582123

zbMATH Keywords

Constrained MinimizationConvergence AnalysisCyclingNonlinear ProgrammingVariable Metric Methods

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Nonlinear programming (90C30)

Cites work

• A globally convergent method for nonlinear programming
• Algorithms for nonlinear constraints that use lagrangian functions
• An algorithm for solving linearly constrained optimization problems
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems

Cited in

(15)

• Convergent stepsizes for constrained optimization algorithms
• A globally convergent algorithm for nonlinearly constrained optimization problems
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
• A new technique for inconsistent QP problems in the SQP method
• \(L_ p\)-spectral estimation with an \(L_ \infty\)-upper bound
• Equality and inequality constrained optimization algorithms with convergent stepsizes
• Computational methods for optimum design of large complex systems
• A successive quadratic programming method that uses new corrections for search directions
• Unification of basic and composite nondifferentiable optimization
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis

This page was built for publication: Some examples of cycling in variable metric methods for constrained minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187603)