A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

DOI10.1080/01630560802000918zbMath1176.90570OpenAlexW2051294655MaRDI QIDQ3506289

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

Publication date: 12 June 2008

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560802000918

zbMATH Keywords

superlinear convergencegeneralized projectionstrongly subfeasible

Mathematics Subject Classification ID

Related Items (13)

A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization

Uses Software

• SNOPT
• FSQP
• filterSQP
• FFSQP(f77)
• NLPQL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function
• 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
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
• 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
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Combined phase I—phase II methods of feasible directions
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Nonlinear programming without a penalty function.

This page was built for publication: A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization