Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
From MaRDI portal
Publication:2343065
DOI10.1007/s11750-015-0368-xzbMath1329.90136OpenAlexW1965923636MaRDI QIDQ2343065
Publication date: 4 May 2015
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0368-x
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Stability of possibly nonisolated solutions of constrained equations, with applications to complementarity and equilibrium problems, Subspace-stabilized sequential quadratic programming, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- Local convergence of an inexact-restoration method and numerical experiments
- A framework for analyzing local convergence properties with applications to proximal-point algorithms
- A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization
- An accelerated Newton method for equations with semismooth jacobians and nonlinear complementarity problems
- A new line search inexact restoration approach for nonlinear programming
- Starlike domains of convergence for Newton's method at singularities
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Inexact-restoration algorithm for constrained optimization
- Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Active Set Identification in Nonlinear Programming
- Error bounds for support vector machines with application to the identification of active constraints
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- On the Accurate Identification of Active Constraints
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- On Structure and Computation of Generalized Nash Equilibria
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
