Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

10.1007/s10107-003-0431-5

Saved in:
Bibliographic Details
Main Authors: Zhou, G., Toh, K.-C.
Other Authors: MATHEMATICS
Format: Article
Published: 2014
Subjects:
Inexact search direction
Infeasible interior point method
Polynomial complexity
Primal-dual
Semidefinite programming
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

Internet

http://scholarbank.nus.edu.sg/handle/10635/103947

Similar Items