A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization

DOI10.1080/02331934.2020.1827406zbMath1489.90213OpenAlexW3089844297MaRDI QIDQ5085236

Qing-Jie Hu, Chun-Ming Tang, Dao Lan Han, Jin-Bao Jian

Publication date: 27 June 2022

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

sequential quadratic programmingnonlinear programminginequality constraintsline searchfinite convergence

Mathematics Subject Classification ID

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

Related Items (1)

Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure

Uses Software

• LANCELOT
• ipfilter
• CUTE

Cites Work

• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• Nonlinear programming without a penalty function or a filter
• Linear and nonlinear programming.
• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
• A penalty-function-free line search SQP method for nonlinear programming
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
• Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
• A penalty-free method with line search for nonlinear equality constrained optimization
• A robust sequential quadratic programming method
• A globally convergent primal-dual interior-point filter method for nonlinear programming
• A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
• A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Numerical Optimization
• CUTE
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Nonlinear Programming
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization