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. |
---|---|
其他作者: | MATHEMATICS |
格式: | Article |
出版: |
2014
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/103947 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
由: Li, L., et al.
出版: (2014) -
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
由: LI LU
出版: (2011) -
An inexact interior point method for L1-regularized sparse covariance selection
由: Li, L., et al.
出版: (2014) -
A new decomposition technique in solving multistage stochastic linear programs by infeasible interior point methods
由: Liu, X., et al.
出版: (2013) -
Some new search directions for primal-dual interior point methods in semidefinite programming
由: Toh, K.-C.
出版: (2014)