The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
From MaRDI portal
Publication:3428832
Recommendations
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
Cited in
(8)- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for \(P_*(\kappa)\)-LCP
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- Kernel-function based primal-dual algorithms for \(P_* (\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
This page was built for publication: The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428832)
