A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization
From MaRDI portal
Publication:5085236
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
Cites work
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A penalty-free method with line search for nonlinear equality constrained optimization
- A penalty-function-free line search SQP method for nonlinear programming
- A robust sequential quadratic programming method
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- 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
- Benchmarking optimization software with performance profiles.
- CUTE
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Linear and nonlinear programming.
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- Nonlinear Programming
- Nonlinear programming without a penalty function or a filter
- Nonlinear programming without a penalty function.
- Numerical Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- On the convexity and existence of solutions to quadratic programming problems with convex constraint
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
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
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)
