Some new search directions for primal-dual interior point methods in semidefinite programming
10.1137/S1052623498335067
Saved in:
Main Author: | Toh, K.-C. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104169 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
by: Zhou, G., et al.
Published: (2014) -
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
by: LI LU
Published: (2011) -
An inexact primal-dual path following algorithm for convex quadratic SDP
by: Toh, K.-C.
Published: (2014) -
On the Nesterov-Todd direction in semidefinite programming
by: Todd, M.J., et al.
Published: (2014) -
A note on the calculation of step-lengths in interior-point methods for semidefinite programming
by: Toh, K.-C.
Published: (2014)