Polynomial convergence of predictor-corrector algorithms for SDP based on the KSH family of directions
zbMATH Open1247.90263MaRDI QIDQ2907979FDOQ2907979
Authors: Feixiang Chen
Publication date: 4 September 2012
Published in: International Journal of Contemporary Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: http://www.m-hikari.com/ijcms-2011/25-28-2011/index.html
Recommendations
- Polynomial convergence of primal-dual algorithms for SDP based on the KSH family of directions
- A new predictor-corrector algorithm for SDP with polynomial convergence
- Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
- A predictor-corrector algorithms with polynomial convergence for SDLCP based on the M-Z family of directions
- Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions
polynomial complexityinterior-point algorithmpath-following methodssemidefinite programming 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 (2)
This page was built for publication: Polynomial convergence of predictor-corrector algorithms for SDP based on the KSH family of directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907979)