A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity

DOI10.1016/j.amc.2004.01.016zbMath1058.90077OpenAlexW1990383971MaRDI QIDQ1765848

Jin-Bao Jian

Publication date: 23 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.amc.2004.01.016

zbMATH Keywords

Sequential quadratic programmingNonlinear programmingConstrained optimizationSQPFeasible descent algorithmSuperlinear convergenceProjection methodGeneralized projectionNonlinear inequality

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (3)

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

Cites Work

• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• A globally convergent method for nonlinear programming
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
• A superlinearly and quadratically convergent SQP type feasible method for 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
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• A successive quadratic programming algorithm with global and superlinear convergence properties
• 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 surperlinearly convergent algorithm for constrained optimization problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Sequential Quadratic Programming with Penalization of the Displacement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity