Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming

zbMATH Open1373.90098MaRDI QIDQ2412154

Yanyan Li

Publication date: 25 October 2017

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://bims.iranjournals.ir/article_897.html

zbMATH Keywords

polynomial complexityconvex quadratic symmetric cone programminginexact search directionsshort and large step feasible

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Related Items (1)

Convergence analysis of an inexact feasible interior point method for convex quadratic programming

This page was built for publication: Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412154)