Convex Relaxations for Subset Selection

Details Convex Relaxations for Subset Selection Convex Relaxations for Subset Selection

2010-06-18

arxiv.org/abs/1006.3601v1

Mathematics

Optimization and Control

Scientific paper

We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the quality of these relaxations by studying the approximation ratio of sparse eigenvalue relaxations. Our results are used to improve the performance of branch-and-bound algorithms to produce exact solutions to subset selection problems.

Affiliated with

Also associated with

No associations

Rating

Convex Relaxations for Subset 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 Convex Relaxations for Subset Selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Relaxations for Subset Selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260140