A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
From MaRDI portal
Publication:2434995
DOI10.1007/s10107-012-0586-zzbMath1282.90177MaRDI QIDQ2434995
Alexey S. Kurennoy, Mikhail V. Solodov, Alexey F. Izmailov
Publication date: 3 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0586-z
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C55: Methods of successive quadratic programming type
Related Items
A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, Critical Multipliers in Semidefinite Programming, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions, Value function gradient learning for large-scale multistage stochastic programming problems, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, A Lipschitzian error bound for convex quadratic symmetric cone programming, Combining stabilized SQP with the augmented Lagrangian algorithm, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, Quantitative stability analysis of stochastic quasi-variational inequality problems and applications, Critical solutions of nonlinear equations: local attraction for Newton-type methods, Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants, Augmented Lagrangian methods for convex matrix optimization problems, On the cost of solving augmented Lagrangian subproblems, Newton-type methods: a broader view, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Critical solutions of nonlinear equations: stability issues, Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption, Unnamed Item, Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
Cites Work
- Unnamed Item
- Unnamed Item
- Stabilized SQP revisited
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
- Lifting mathematical programs with complementarity constraints
- On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
- Stability in the presence of degeneracy and error estimation
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Error bounds in mathematical programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- Computational schemes for large-scale problems in extended linear- quadratic programming
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Errata in: ``Implicit multifunction theorems for the sensitivity analysis of variational conditions
- Solution sensitivity for Karush–Kuhn–Tucker systems with non-unique Lagrange multipliers
- Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition
- Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- On the Accurate Identification of Active Constraints
- Stability Theory for Parametric Generalized Equations and Variational Inequalities Via Nonsmooth Analysis
- Newton-Type Methods for Optimization Problems without Constraint Qualifications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions
