Enhancing low-rank solutions in semidefinite relaxations of Boolean quadratic problems

Boolean quadratic optimization problems occur in a number of applications. Their mixed integer-continuous nature is challenging, since it is inherently NP-hard. For this motivation, semidefinite programming relaxations (SDR's) are proposed in the literature to approximate the solution, which recasts the problem into convex optimization. Nevertheless, SDR's do not guarantee the extraction of the correct binary minimizer. In this paper, we present a novel approach to enhance the binary solution recovery. The key of the proposed method is the exploitation of known information on the eigenvalues of the desired solution. As the proposed approach yields a non-convex program, we develop and analyze an iterative descent strategy, whose practical effectiveness is shown via numerical results.

[1]  Pini Gurfil,et al.  Sensor selection via compressed sensing , 2013, Autom..

[2]  Vihangkumar V. Naik,et al.  Embedded Mixed-Integer Quadratic Optimization using Accelerated Dual Gradient Projection , 2017 .

[3]  Y. Nesterov.  Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[4]  Jean B. Lasserre.  A MAX-CUT formulation of 0/1 programs , 2016, Oper. Res. Lett..

[5]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[6]  Gitta Kutyniok,et al.  PROMP: A sparse recovery approach to lattice-valued signals , 2017, Applied and Computational Harmonic Analysis.

[7]  Christoph Schnörr,et al.  Prior Learning and Convex-Concave Regularization of Binary Tomography , 2005, Electron. Notes Discret. Math..

[8]  T. Schülea,et al.  Discrete tomography by convex – concave regularization and D . C . programming , 2005 .

[9]  Anthony Man-Cho So,et al.  Low-Rank Semidefinite Programming: Theory and Applications , 2016, Found. Trends Optim..

[10]  Sophie Fosson,et al.  Non-convex approach to binary compressed sensing , 2018, 2018 52nd Asilomar Conference on Signals, Systems, and Computers.

[11]  Babak Hassibi,et al.  Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms , 2013, IEEE Transactions on Signal Processing.

[12]  J. Lasserre.  An Introduction to Polynomial and Semi-Algebraic Optimization , 2015 .

[13]  Enrico Magli,et al.  Sparsity estimation from compressive projections via sparse random matrices , 2018, EURASIP Journal on Advances in Signal Processing.

[14]  G. Rinaldi,et al.  Computational approaches to Max-Cut , 2012 .

[15]  Rama Chellappa,et al.  Joint Sparse Representation for Robust Multimodal Biometrics Recognition , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  S. Fosson.  Non-convex Lasso-kind approach to compressed sensing for finite-valued signals , 2018, 1811.03864.

[17]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[18]  J. Gallier.  Quadratic Optimization Problems , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[19]  J. Lasserre.  Convergent LMI relaxations for nonconvex quadratic programs , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[20]  W. Marsden.  I and J , 2012 .

[21]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[22]  Houqing Zhou.  On some trace inequalities for positive definite Hermitian matrices , 2014 .

[23]  Babak Hassibi,et al.  Sparse phase retrieval: Convex algorithms and limitations , 2013, 2013 IEEE International Symposium on Information Theory.

[24]  Mohammad Abuabiah,et al.  Recovery of Binary Sparse Signals From Compressed Linear Measurements via Polynomial Optimization , 2019, IEEE Signal Processing Letters.

[25]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[26]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[27]  Alberto Bemporad,et al.  A Numerically Robust Mixed-Integer Quadratic Programming Solver for Embedded Hybrid Model Predictive Control , 2018 .

[28]  Holger Rauhut,et al.  A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.

[29]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[30]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..