An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

DOI10.1016/J.CAMWA.2004.09.004MaRDI QIDQ2485397zbMATH OpenOpenAlexFDO

Authors Jinbao Jian, Chun-Ming Tang

Publication date 4 August 2005

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2004.09.004

zbMATH Keywords

Constrained OptimizationFeasible Descent AlgorithmNonlinear InequalitySQPSuperlinear Convergence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Methods of successive quadratic programming type (90C55)

Recommendations

• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
• A variant of feasible descent SQP method for inequality constrained optimization
• scientific article; zbMATH DE number 5647820

Cites work

• A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
• A globally convergent method for nonlinear programming
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• A successive quadratic programming algorithm with global and superlinear convergence properties
• A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
• A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A surperlinearly convergent algorithm for constrained optimization problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Exact penalty function algorithm with simple updating of the penalty parameter
• scientific article; zbMATH DE number 3583207 (Why is no real title available?)
• scientific article; zbMATH DE number 1301595 (Why is no real title available?)
• scientific article; zbMATH DE number 1014538 (Why is no real title available?)
• scientific article; zbMATH DE number 1092103 (Why is no real title available?)
• scientific article; zbMATH DE number 1159542 (Why is no real title available?)
• scientific article; zbMATH DE number 1367674 (Why is no real title available?)
• scientific article; zbMATH DE number 1880805 (Why is no real title available?)
• scientific article; zbMATH DE number 883157 (Why is no real title available?)
• scientific article; zbMATH DE number 938975 (Why is no real title available?)
• More test examples for nonlinear programming codes
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
• Sequential Quadratic Programming with Penalization of the Displacement
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Test examples for nonlinear programming codes
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence

Cited in

(16)

• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
• A variant of feasible descent SQP method for inequality constrained optimization
• An improved active set feasible SQP algorithm for the solution of inequality constrained optimization problems
• scientific article; zbMATH DE number 5647820 (Why is no real title available?)
• A generalized neural network for solving a class of minimax optimization problems with linear constraints
• An improved infeasible SSLE method for constrained optimization without strict complementarity
• A sequential quadratic programming algorithm for nonlinear minimax problems
• Generalised monotone line search algorithm for degenerate nonlinear minimax problems
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• The combination stretching function technique with simulated annealing algorithm for global optimization
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
• A modified SQP algorithm for minimax problems
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization

This page was built for publication: An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485397)