Some examples of cycling in variable metric methods for constrained minimization

DOI10.1007/BF01582123zbMath0402.90088OpenAlexW2032087206MaRDI QIDQ4187603

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

CyclingNonlinear ProgrammingConvergence AnalysisVariable Metric MethodsConstrained Minimization

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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