An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
DOI10.1007/s11590-015-0889-0zbMath1345.90086OpenAlexW2042047906MaRDI QIDQ279835
You-lin Shang, Chang-He Liu, Hong-Wei Liu
Publication date: 29 April 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0889-0
linear complementarity probleminterior-point methodspolynomial complexityMehrotra-type predictor-corrector algorithmwide neighborhood
Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Further development of multiple centrality correctors for interior point methods
- A polynomial-time algorithm for a class of linear complementarity problems
- On homogeneous and self-dual algorithms for LCP
- On a homogeneous algorithm for the monotone complementarity problem
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
