A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence

DOI10.1016/j.cam.2009.11.061zbMath1188.65081MaRDI QIDQ848564

Zhong Jin, Yu-Qing Wang

Publication date: 4 March 2010

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.2009.11.061

zbMATH Keywords

global and superlinear convergence; inequality constrained optimization; Maratos effect; KKT point; FSQP

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

90C55: Methods of successive quadratic programming type

Cites Work

• Unnamed Item
• Unnamed Item
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
• An efficient feasible SQP algorithm for inequality constrained optimization
• A simple feasible SQP algorithm for inequality constrained optimization
• Test examples for nonlinear programming codes
• An improved SQP algorithm for inequality constrained optimization
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
• A sequential quadratically constrained quadratic programming method of feasible directions
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A note on quasi-newton formulae for sparse second derivative matrices
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Numerical Optimization