A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
From MaRDI portal
Publication:2800675
DOI10.1142/S0218127415400350zbMath1334.90177OpenAlexW2264052316MaRDI QIDQ2800675
Xiaojue Ma, Chang Zhou, Hong-Wei Liu
Publication date: 18 April 2016
Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218127415400350
Related Items (1)
Cites Work
- Unnamed Item
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
This page was built for publication: A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
