A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity

DOI10.1016/j.cam.2004.11.008zbMath1075.65082OpenAlexW2112051014MaRDI QIDQ556270

Hai-Yan Zheng, Qing-Jie Hu, Jin-Bao Jian, Chun-Ming Tang

Publication date: 13 June 2005

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

zbMATH Keywords

successive quadratic programmingFeasible descent algorithmGeneral constrained optimizationSmooth optimization problemsStrict complementaritySuperlinear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (13)

An efficient feasible SQP algorithm for inequality constrained optimization ⋮ Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties ⋮ A new superlinearly convergent SQP algorithm for nonlinear minimax problems ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ A feasible SQP method for nonlinear programming ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems

Cites Work

• A globally convergent algorithm for nonlinearly constrained optimization problems
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• A globally convergent method for nonlinear programming
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• Exact penalty function algorithm with simple updating of the penalty parameter
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• 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
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• Some examples of cycling in variable metric methods for constrained minimization
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• Sequential Quadratic Programming with Penalization of the Displacement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity