Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
From MaRDI portal
Publication:4785887
DOI10.1137/S1052623401372946zbMath1026.90085MaRDI QIDQ4785887
Mikhail V. Solodov, Alexey F. Izmailov
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
regularity; singularity; nonlinear equations; superlinear convergence; complementarity; reformulation
90C30: Nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics
Related Items
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints, New implementations of the 2-factor method, An accelerated Newton method for equations with semismooth jacobians and nonlinear complementarity problems, Modified Jacobian smoothing method for nonsmooth complementarity problems, Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Dealing with singularities in nonlinear unconstrained optimization, Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
