Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems

Details Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems

2009-02-08

arxiv.org/abs/0902.1324v2

Statistics

Methodology

Scientific paper

The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact constraint and as such, is a convex problem with polynomial time complexity. Moreover, as a main pratical advantage of this relaxation over the standard Semi-Definite Programming approach, several efficient bundle methods are available for this problem allowing to address problems of very large dimension. The necessary tools from convex analysis are recalled and shown at work for handling the problem of exactness of this relaxation. Two applications are described. The first one is the problem of binary image reconstruction and the second is the problem of multiuser detection in CDMA systems.

Affiliated with

Also associated with

No associations

Rating

Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems 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 Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581224