A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization

DOI10.1080/10556780310001607965zbMath1142.90492OpenAlexW1980761837MaRDI QIDQ4653552

Yi-Fan Xu

Publication date: 7 March 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780310001607965

zbMATH Keywords

convergenceconstrained optimizationSystem of linear equationsQP-free

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites Work

• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Algorithms for nonlinear constraints that use lagrangian functions
• Sequential Quadratic Programming with Penalization of the Displacement

This page was built for publication: A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization