Using the eigenvalue relaxation for binary least-squares estimation problems

DOI10.1016/j.sigpro.2009.04.025zbMath1169.94322arXiv0902.1324OpenAlexW2065939443MaRDI QIDQ839052

Stéphane Chrétien, Franck Corset

Publication date: 1 September 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.1324

zbMATH Keywords

CDMAimage denoisingmultiuser detectionsemi-definite relaxationbinary least squareseigenvalue relaxation

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite programming for discrete optimization and matrix completion problems
• Laplacian eigenvalues and the maximum cut problem
• Applications of convex optimization in signal processing and digital communication
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Bounding the convergence time of the Gibbs sampler in Bayesian image restoration
• Lectures on Modern Convex Optimization
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Designing structured tight frames via an alternating projection method
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Derivatives and Perturbations of Eigenvectors
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite relaxation and nonconvex quadratic optimization
• A Spectral Bundle Method for Semidefinite Programming
• Nonpolyhedral Relaxations of Graph-Bisection Problems
• Convex Relaxations of (0, 1)-Quadratic Programming
• A second-order bundle method to minimize the maximum eigenvalue function.

This page was built for publication: Using the eigenvalue relaxation for binary least-squares estimation problems