![](https://www.pdfsearch.io/img/77a1396c0e7e5b05122bab4df48bc129.jpg) 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 OctoberAbstractAdd to Reading ListSource URL: www.math.nus.edu.sgDownload Document from Source Website File Size: 252,32 KBShare Document on Facebook
|