An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem

DOI10.1007/s11075-015-0005-7zbMath1332.90302OpenAlexW253429297MaRDI QIDQ261844

Behrouz Kheirfam

Publication date: 24 March 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-015-0005-7

zbMATH Keywords

polynomial complexityhorizontal linear complementarity probleminfeasible 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 (7)

An infeasible full NT-step interior point method for circular optimization ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• Corrector-predictor methods for sufficient linear complementarity problems
• A new polynomial-time algorithm for linear programming
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
• An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
• On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
• Computational complexity of LCPs associated with positive definite symmetric matrices
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• 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

This page was built for publication: An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem