Solving Large Scale Quadratic Constrained Basis Pursuit
Inspired by alternating direction method of multipliers and the idea of operator splitting, we propose a efficient algorithm for solving large-scale quadratically constrained basis pursuit. Experimental results show that the proposed algorithm can achieve 50~~100 times speedup when compared with the baseline interior point algorithm implemented in CVX.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences
We consider the problem of solving a large-scale Quadratically Constrained Quadratic Program. Such problems occur naturally in many scientific and web applications. Although there are efficient methods which tackle this …
Parabolic Relaxation for Quadratically-constrained Quadratic Programming -- Part I: Definitions & Basic Properties
For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original …
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form
Semidefinite programs (SDP) are important in learning and combinatorial optimization with numerous applications. In pursuit of low-rank solutions and low complexity algorithms, we consider the Burer--Monteiro factorizati…
Combinatorial OptimizationFormMatrix CompletionAn ADMM algorithm for solving a proximal bound-constrained quadratic program
We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly ef…
Convergence Analysis of Consensus-ADMM for General QCQP
We analyze the convergence properties of the consensus-alternating direction method of multipliers (ADMM) for solving general quadratically constrained quadratic programs. We prove that the augmented Lagrangian function …