# Solving Large Scale Quadratic Constrained Basis Pursuit

arXiv: https://arxiv.org/abs/2104.02475 · HTML: https://mlsanity.com/paper/2104.02475/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 3 references that are in the map.
- First posted on arXiv 2 Apr 2021.

## Builds on (most cited first, 1 of 1)

- [Parameter Selection and Pre-Conditioning for a Graph Form Solver](https://mlsanity.com/paper/1503.08366/) (2015)

## Abstract (arXiv)

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.