Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
10.1007/s10107-003-0431-5
Saved in:
Main Authors: | Zhou, G., Toh, K.-C. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103947 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014) -
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
by: LI LU
Published: (2011) -
An inexact interior point method for L1-regularized sparse covariance selection
by: Li, L., et al.
Published: (2014) -
A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
by: Liu, X., et al.
Published: (2013) -
Some new search directions for primal-dual interior point methods in semidefinite programming
by: Toh, K.-C.
Published: (2014)