A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
DOI10.1080/02331934.2020.1827406zbMATH Open1489.90213OpenAlexW3089844297MaRDI QIDQ5085236FDOQ5085236
Authors: Qingjie Hu, Jinbao Jian, Chun-Ming Tang, Daolan Han 
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
Recommendations
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- A new sequential quadratic programming method without a penalty function or a filter
- A filter-free sequential quadratic programming algorithm with infeasibility detection
nonlinear programmingsequential quadratic programminginequality constraintsline searchfinite convergence
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- CUTE
- Numerical Optimization
- Benchmarking optimization software with performance profiles.
- 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
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Nonlinear Programming
- Nonlinear programming without a penalty function.
- Nonlinear programming without a penalty function or a filter
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Title not available (Why is that?)
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Title not available (Why is that?)
- A robust sequential quadratic programming method
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- On the convexity and existence of solutions to quadratic programming problems with convex constraint
- A penalty-free method with line search for nonlinear equality constrained optimization
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
Cited In (4)
- A filter-free sequential quadratic programming algorithm with infeasibility detection
- A new sequential quadratic programming method without a penalty function or a filter
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085236)
