A variant of SQP method for inequality constrained optimization and its global convergence

DOI10.1016/j.cam.2005.11.004zbMath1103.65068MaRDI QIDQ2432728

Zeng-xin Wei, Ke-Cun Zhang, Jiangtao Mo

Publication date: 25 October 2006

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2005.11.004

zbMATH Keywords

global convergence; sequential quadratic programming; numerical examples; inequality constrained optimization; SQP method

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C55: Methods of successive quadratic programming type

Related Items

Two-phase generalized reduced gradient method for constrained global optimization, A new norm-relaxed SQP algorithm with global convergence, Parallel variable distribution algorithm for constrained optimization with nonmonotone technique

Cites Work

• Unnamed Item
• Unnamed Item
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• A globally convergent algorithm for nonlinearly constrained optimization problems
• Test examples for nonlinear programming codes
• An algorithm for solving linearly constrained minimax problems
• A generalization of the norm-relaxed method of feasible directions
• A variant of the Topkis-Veinott method for solving inequality constrained optimization problems
• A robust sequential quadratic programming method
• On the convergence of a new trust region algorithm
• A sequential quadratic programming method for potentially infeasible mathematical programs
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• A modified SQP method and its global convergence
• A superlinearly convergent method of feasible directions.