A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

DOI10.1287/MOOR.18.2.334zbMATH Open0791.90060OpenAlexW2008774137WikidataQ92953125 ScholiaQ92953125MaRDI QIDQ5287986FDOQ5287986

Yinyu Ye

Publication date: 5 August 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.18.2.334

Recommendations

• A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone
• An interior point potential reduction algorithm for the linear complementarity problem
• scientific article; zbMATH DE number 653034
• Generalized Linear Complementarity Problems

zbMATH Keywords

polynomial-time approximation schemelinear complementaritypotential reduction algorithm\(\varepsilon\)-approximate stationary pointpolynomal-time algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (18)

• Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems
• On the equivalence of linear complementarity problems
• Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
• A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
• On the solution of the extended linear complementarity problem
• The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems
• A smoothing Gauss-Newton method for the generalized HLCP
• A dynamic model to solve weighted linear complementarity problems
• On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
• A class of smoothing functions for nonlinear and mixed complementarity problems
• Approximate Equilibria for Strategic Two Person Games
• A proximal gradient descent method for the extended second-order cone linear complementarity problem
• On the extended linear complementarity problem
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
• Local uniqueness of solutions to the extended linear complementarity problem
• Algorithms for linear programming with linear complementarity constraints
• On the complexity of approximating a KKT point of quadratic programming
• An interior point potential reduction method for constrained equations

This page was built for publication: A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

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