First-order methods for sparse covariance selection

Details First-order methods for sparse covariance selection First-order methods for sparse covariance selection

2006-09-28

arxiv.org/abs/math/0609812v1

Mathematics

Optimization and Control

Scientific paper

Given a sample covariance matrix, we solve a maximum likelihood problem penalized by the number of nonzero coefficients in the inverse covariance matrix. Our objective is to find a sparse representation of the sample data and to highlight conditional independence relationships between the sample variables. We first formulate a convex relaxation of this combinatorial problem, we then detail two efficient first-order algorithms with low memory requirements to solve large-scale, dense problem instances.

Affiliated with

Also associated with

No associations

Rating

First-order methods for sparse covariance selection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with First-order methods for sparse covariance selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and First-order methods for sparse covariance selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532332