Path-following interior-point algorithm for monotone linear complementarity problems

DOI10.1142/S1793557122501704zbMath1504.90168OpenAlexW4200178908MaRDI QIDQ5876796

Unnamed Author

Publication date: 2 February 2023

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

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

zbMATH Keywords

linear complementarity probleminterior-point methodspolynomial complexityshort-step algorithm

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New method for determining search directions for interior-point algorithms in linear optimization
• Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A polynomial-time algorithm for a class of linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A generalized direction in interior point method for monotone linear complementarity problems
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem

This page was built for publication: Path-following interior-point algorithm for monotone linear complementarity problems