An SQP algorithm for degenerate problems
From MaRDI portal
Recommendations
- Modifying SQP for Degenerate Problems
- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- scientific article; zbMATH DE number 1932419
Cited in
(8)- An SQP algorithm with cautious updating criteria for nonlinear degenerate problems
- Resolving degeneracy in quadratic programming
- An adaptively regularized sequential quadratic programming method for equality constrained optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- Modifying SQP for Degenerate Problems
- A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization
- Numerical behavior of a stabilized SQP method for degenerate NLP problems
- Combining stabilized SQP with the augmented Lagrangian algorithm
This page was built for publication: An SQP algorithm for degenerate problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778168)