An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path

DOI10.1080/00207160.2017.1283020zbMath1393.90135OpenAlexW2581419493MaRDI QIDQ3177455

Behrouz Kheirfam

Publication date: 25 July 2018

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2017.1283020

zbMATH Keywords

polynomial complexityhorizontal linear complementarity problemwide neighbourhoodinfeasible interior-point methodsarc-search direction

Mathematics Subject Classification ID

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

Related Items (7)

An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

Cites Work

• An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A polynomial arc-search interior-point algorithm for linear programming
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• A new polynomial-time algorithm for linear programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path