A new class of infeasible interior-point algorithm for linear complementarity problem

DOI10.1007/s11859-013-0923-yzbMath1299.90378OpenAlexW1988776931MaRDI QIDQ5400131

Xiaoyu Gong, Zhenpeng Hu, Xian-Jia Wang

Publication date: 28 February 2014

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

Full work available at URL: https://doi.org/10.1007/s11859-013-0923-y

zbMATH Keywords

linear complementarity problempolynomial complexityinfeasible interior-point methodfull-Newton step

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

This page was built for publication: A new class of infeasible interior-point algorithm for linear complementarity problem