A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP (PJO)
Volume 7
Number 1
pp. 43-61
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
Lu Li and Kim-Chuan Toh
Key words
Mathematices Subject Classification
semidefinite programming, semidefinite least squares, infeasible interior point method, inexact search direction, polynomial complexity
90C22, 90C25, 90C51, 65F10
ONLINE SUBSCRIPTION (Download)
Copyright© 2011 Yokohama Publishers
For Editor
For Authors
