Newton's method may fail to recognize proximity to optimal points in constrained optimization
From MaRDI portal
(Redirected from Publication:344970)
Recommendations
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- On the convergence of Newton iterations to non-stationary points
- Newton's iterates can converge to non-stationary points
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints
- Simple examples for the failure of Newton's method with line search for strictly convex minimization
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A practical optimality condition without constraint qualifications for nonlinear programming
- Combining stabilized SQP with the augmented Lagrangian algorithm
- Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function
- Modifying SQP for Degenerate Problems
- On sequential optimality conditions for smooth constrained optimization
- On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
- Practical augmented Lagrangian methods for constrained optimization
- Stabilized SQP revisited
- Superlinear convergence of a stabilized SQP method to a degenerate solution
Cited in
(10)- Optimality conditions for nonlinear second-order cone programming and symmetric cone programming
- An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
- Complexity and performance of an augmented Lagrangian algorithm
- A novel sequential optimality condition for smooth constrained optimization and algorithmic consequences
- On the best achievable quality of limit points of augmented Lagrangian schemes
- On the convergence of Newton iterations to non-stationary points
- Simple examples for the failure of Newton's method with line search for strictly convex minimization
- Optimality conditions and global convergence for nonlinear semidefinite programming
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees
- Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications
This page was built for publication: Newton's method may fail to recognize proximity to optimal points in constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344970)
