A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP Lu Li ∗, and Kim-Chuan Toh† 1 OctoberAbstract

First Page		Document Content
Date: 2009-10-01 06:49:01		A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP Lu Li ∗, and Kim-Chuan Toh† 1 OctoberAbstract Add to Reading List Source URL: www.math.nus.edu.sg Download Document from Source Website File Size: 252,32 KB Share Document on Facebook