A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
From MaRDI portal
Publication:2422131
DOI10.1007/s40305-017-0178-yzbMath1424.90273OpenAlexW2771037827MaRDI QIDQ2422131
Mohammad Pirhaji, Hossein Mansouri, Maryam Zangiabadi
Publication date: 18 June 2019
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-017-0178-y
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new polynomial-time algorithm for linear programming
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- On homogeneous and self-dual algorithms for LCP
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Improved infeasible-interior-point algorithm for linear complementarity problerns
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- The Linear Complementarity Problem
- Computational complexity of LCPs associated with positive definite symmetric matrices
- 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: A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
