A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs

DOI10.22130/scma.2018.67206.260zbMath1438.90350OpenAlexW2940058786MaRDI QIDQ5241637

Ali Nakhaei Amroudi, Mojtaba Pirhaji, Alireza Shojaei-Fard

Publication date: 1 November 2019

Full work available at URL: https://doaj.org/article/44fb3ebd52cb4935826dbab5bb054767

zbMATH Keywords

interior-point methodspolynomial complexitysymmetric conemixed linear complementarity problem

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 polynomial interior-point algorithm for monotone linear complementarity problems
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A homogeneous model for mixed complementarity problems over symmetric cones
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Similarity and other spectral relations for symmetric cones
• A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP