A potential-reduction algorithm for linear complementarity problems

DOI10.1007/BF02830592MaRDI QIDQ5697858zbMATH OpenOpenAlexFDO

Authors Yanjin Wang, Pusheng Fei, Zi-Zong Yan

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 problemspotential functionP-matrixinfeasible-starting-point

Mathematics Subject Classification ID

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

Recommendations

• A modified potential reduction algorithm for linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• Solution of P₀ -Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
• An interior point potential reduction algorithm for the linear complementarity problem
• A potential reduction algorithm for linearly constrained convex programming
• scientific article; zbMATH DE number 724220
• A Short-Cut Potential Reduction Algorithm for Linear Programming
• Publication:4946120
• A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone
• Extensions of the potential reduction algorithm for linear programming

Cites work

• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• 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
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings

Cited in

(6)

• A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
• scientific article; zbMATH DE number 724220 (Why is no real title available?)
• An interior point potential reduction algorithm for the linear complementarity problem
• scientific article; zbMATH DE number 3862340 (Why is no real title available?)
• A class of infeasible interior point algorithms for convex quadratic programming
• Reducing horizontal linear complementarity problems

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

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