Feasible descent algorithms for mixed complementarity problems

DOI10.1007/S101070050101MaRDI QIDQ1968793zbMATH OpenOpenAlexFDO

Authors Michael C. Ferris, Christian Kanzow, Todd S. Munson

Publication date 21 March 2000

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070050101

zbMATH Keywords

feasible descent methodsglobal convergencemixed complementarity problemssuperlinear convergence

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 5041529
• A descent algorithm for the nonlinear complementarity problems
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• A Positive Algorithm for the Nonlinear Complementarity Problem
• A homotopy-based algorithm for mixed complementarity problems

Cited in

(27)

• Feasible semismooth Newton method for a class of stochastic linear complementarity problems
• Constraining surface interpolations using elastic plate bending solutions with applications to geologic folding
• A comparison of large scale mixed complementarity problem solvers
• Complementarity problems in GAMS and the PATH solver
• Fast convergence of an inexact interior point method for horizontal complementarity problems
• Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements
• Some recent advances in projection-type methods for variational inequalities
• On the Newton-type method with admissible trajectories for mixed complementarity problems
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• A modified feasible semi-smooth asymptotically Newton method for nonlinear complementarity problems
• A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities
• On regularity conditions for complementarity problems
• A new proximal-based globalization strategy for the Josephy‐Newton method for variational inequalities
• A globally convergent BFGS method for pseudo-monotone variational inequality problems
• On a semismooth least squares formulation of complementarity problems with gap reduction
• Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
• scientific article; zbMATH DE number 5041529 (Why is no real title available?)
• Nonholonomic elastoplastic analysis involving unilateral frictionless contact as a mixed complementarity problem
• A projected-gradient interior-point algorithm for complementarity problems
• On the natural merit function for solving complementarity problems
• Polyhedral Newton-min algorithms for complementarity problems
• A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
• On error bounds and Newton-type methods for generalized Nash equilibrium problems
• Finite purchasing power and computations of Bertrand-Nash equilibrium prices
• New simple smooth merit function for box constrained variational inequalities and damped Newton type method
• A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
• Numerical comparisons of two effective methods for mixed complementarity problems

Describes a project that uses

Uses Software

• MCPLIB
• PATH Solver
• QPCOMP
• GAMS
• GQTPAR

This page was built for publication: Feasible descent algorithms for mixed complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968793)