An inexact interior point method for L1-regularized sparse covariance selection
10.1007/s12532-010-0020-6
Saved in:
Main Authors: | Li, L., Toh, K.-C. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102842 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
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) -
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
by: Zhou, G., et al.
Published: (2014) -
Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
by: Chai, J.-S., et al.
Published: (2014) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014)