An infeasible interior-point method with improved centering steps for monotone linear complementarity problems

DOI10.1142/S1793557115500370zbMath1326.90085OpenAlexW2235556617MaRDI QIDQ3452701

Zsolt Darvay, Soodabeh Asadi, Hossein Mansouri

Publication date: 13 November 2015

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557115500370

zbMATH Keywords

linear complementarity problemcentral pathinfeasible interior-point methodcentering step

Mathematics Subject Classification ID

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

Related Items (1)

A generalized direction in interior point method for monotone linear complementarity problems

Cites Work

• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems

This page was built for publication: An infeasible interior-point method with improved centering steps for monotone linear complementarity problems