An efficient algorithm for convex quadratic semi-definite optimization

DOI10.3934/NACO.2012.2.129zbMath1246.65096OpenAlexW2317574856MaRDI QIDQ449548

Lipu Zhang, Yinghong Xu, Zhengjing Jin

Publication date: 30 August 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2012.2.129

zbMATH Keywords

complexity analysisinterior point algorithmconvex quadratic semi-definite optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51)

Related Items (3)

A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization ⋮ Unnamed Item ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term

This page was built for publication: An efficient algorithm for convex quadratic semi-definite optimization