A sequential quadratic optimization algorithm with rapid infeasibility detection
nonlinear optimizationsuperlinear convergenceline search methodsexact penalizationsequential quadratic optimizationinfeasibility detection
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Newton-type methods (49M15) Numerical methods based on necessary conditions (49M05)
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- A filter-free sequential quadratic programming algorithm with infeasibility detection
- scientific article; zbMATH DE number 1932419
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- Constrained composite optimization and augmented Lagrangian methods
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- An inexact sequential quadratic optimization algorithm for nonlinear optimization
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- Quadratic Optimization With Similarity Constraint for Unimodular Sequence Synthesis
- On the augmented subproblems within sequential methods for nonlinear programming
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: application in supervised machine learning
- An overview of nonlinear optimization
- Multiobjective optimization with least constraint violation: optimality conditions and exact penalization
- A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
- Study on convex optimization with least constraint violation under a general measure
- Infeasible and critically feasible optimal control
- An inexact first-order method for constrained nonlinear optimization
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Specialized fast algorithms for IQC feasibility and optimization problems.
- A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- An SQP-type proximal gradient method for composite optimization problems with equality constraints
- A robust implementation of a sequential quadratic programming algorithm with successive error restoration
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees
- Optimization with least constraint violation
This page was built for publication: A sequential quadratic optimization algorithm with rapid infeasibility detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192106)
