Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
From MaRDI portal
(Redirected from Publication:2898536)
Recommendations
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
- Primal-dual algorithms for SDLCP based on the Monteiro-Zhang family of directions
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions
Cited in
(8)- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Primal-dual algorithms for SDLCP based on the Monteiro-Zhang family of directions
- Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
- A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
- scientific article; zbMATH DE number 1372699 (Why is no real title available?)
This page was built for publication: Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898536)