An inexact primal-dual path following algorithm for convex quadratic SDP

Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 X

• Type: Journal
• Year: 2008
• Where: MP
• Authors: Kim-Chuan Toh
• Keywords: Convex Quadratic Semidefinite, MP 2008, Semidefinite, Semidefinite Programming