A potential-reduction algorithm for linear complementarity problems

DOI10.1007/BF02830592zbMath1203.90163OpenAlexW1994809998MaRDI QIDQ5697858

Pusheng Fei, Zi-Zong Yan, Yanjin Wang

Publication date: 27 October 2005

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

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

zbMATH Keywords

linear complementarity problemsP-matrixpotential functioninfeasible-starting-point

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Global convergence in infeasible-interior-point algorithms
• On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

This page was built for publication: A potential-reduction algorithm for linear complementarity problems