An adaptive infeasible interior-point algorithm for linear complementarity problems

DOI10.1007/s40305-013-0031-xzbMath1305.90396OpenAlexW1988419666MaRDI QIDQ743784

Hossein Mansouri, Mohammad Pirhaji

Publication date: 30 September 2014

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-013-0031-x

zbMATH Keywords

linear complementarity problempolynomial complexitycentral pathinfeasible-interior-point-method

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 potential reduction method for tensor complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• Feasibility issues in a primal-dual interior-point method for linear programming
• Test examples for nonlinear programming codes
• A unified approach to interior point algorithms for linear complementary problems
• On a homogeneous algorithm for the monotone complementarity problem
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• Self-regular functions and new search directions for linear and semidefinite optimization
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• Improved infeasible-interior-point algorithm for linear complementarity problerns
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: An adaptive infeasible interior-point algorithm for linear complementarity problems