Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems
From MaRDI portal
Publication:3072041
Recommendations
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A new Mehrotra-type predictor-corrector algorithm for linear programming
- A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
Cited in
(9)- A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
- The curvature integral and the complexity of linear complementarity problems
- Complexity of a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problems
- A new Mehrotra-type predictor-corrector algorithm for linear programming
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
This page was built for publication: Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072041)
