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

First Page	Meta Content
	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 Document Date: 2009-10-01 06:49:01 Open Document File Size: 252,32 KB Share Result on Facebook

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