A theoretical and numerical comparison of some semismooth algorithms for complementarity problems

From MaRDI portal
Revision as of 02:59, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1583587


DOI10.1023/A:1008705425484zbMath0964.90046MaRDI QIDQ1583587

Christian Kanzow, Francisco Facchinei, Tecla de Luca

Publication date: 19 July 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)


90C06: Large-scale problems in mathematical programming

90C53: Methods of quasi-Newton type

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)


Related Items

Inexact semismooth Newton methods for large-scale complementarity problems, Iterative method with modification of the right-hand side vector for nonlinear complementarity problems, Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints, A new class of complementarity functions for symmetric cone complementarity problems, Exact penalties for variational inequalities with applications to nonlinear complementarity problems, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Optimization problems with equilibrium constraints and their numerical solution., Computation of generalized differentials in nonlinear complementarity problems, Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints, Globalizing a nonsmooth Newton method via nonmonotone path search, Generalized Nash equilibrium problems and Newton methods, Globally convergent Jacobian smoothing inexact Newton methods for NCP, On the computation of an element of Clarke generalized Jacobian for a vector-valued max function, Solving box constrained variational inequalities by using the natural residual with D-gap function globalization, Global Newton-type methods and semismooth reformulations for NCP, Active-set Newton methods for mathematical programs with vanishing constraints, A Newton's method for perturbed second-order cone programs, A globalized Newton method for the computation of normalized Nash equilibria, A two-level domain decomposition algorithm for linear complementarity problem, Boundedness and regularity properties of semismooth reformulations of variational inequalities, A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*, Two-level additive Schwarz algorithms for nonlinear complementarity problem with anM-function