A predictor-corrector algorithms with polynomial convergence for SDLCP based on the M-Z family of directions
zbMATH Open1242.90258MaRDI QIDQ2898511FDOQ2898511
Authors: Feixiang Chen, Zhang Hui 
Publication date: 11 July 2012
Published in: Applied Mathematical Sciences (Ruse) (Search for Journal in Brave)
Full work available at URL: http://www.m-hikari.com/ams/ams-2011/ams-33-36-2011/index.html
Recommendations
- Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions
- Polynomial convergence of predictor-corrector for SDLCP based on the M-Z family of directions
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
- A new predictor-corrector algorithm for SDP with polynomial convergence
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
polynomial complexityinterior-point algorithmpath-following methodssemidefinite linear complementarity problems
Roundoff error (65G50) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Algorithms with automatic result verification (65G20)
Cited In (5)
- Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions
- Polynomial convergence of predictor-corrector algorithms for SDP based on the KSH family of directions
- A new predictor-corrector algorithm for SDP with polynomial convergence
- Polynomial convergence of predictor-corrector for SDLCP based on the M-Z family of directions
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
This page was built for publication: A predictor-corrector algorithms with polynomial convergence 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 Q2898511)
