A primal-dual homotopy algorithm for _1-minimization with _ -constraints
From MaRDI portal
Publication:1639715
Abstract: In this paper we propose a primal-dual homotopy method for -minimization problems with infinity norm constraints in the context of sparse reconstruction. The natural homotopy parameter is the value of the bound for the constraints and we show that there exists a piecewise linear solution path with finitely many break points for the primal problem and a respective piecewise constant path for the dual problem. We show that by solving a small linear program, one can jump to the next primal break point and then, solving another small linear program, a new optimal dual solution is calculated which enables the next such jump in the subsequent iteration. Using a theorem of the alternative, we show that the method never gets stuck and indeed calculates the whole path in a finite number of steps. Numerical experiments demonstrate the effectiveness of our algorithm. In many cases, our method significantly outperforms commercial LP solvers; this is possible since our approach employs a sequence of considerably simpler auxiliary linear programs that can be solved efficiently with specialized active-set strategies.
Recommendations
- On primal and dual infeasibility certificates in a homogeneous model for convex optimization
- An inexact primal-dual algorithm for semi-infinite programming
- scientific article; zbMATH DE number 860065
- A primal-dual proximal point algorithm for constrained convex programs
- A primal-dual flow for affine constrained convex optimization
- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
- scientific article; zbMATH DE number 124640
Cites work
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A direct estimation approach to sparse linear discriminant analysis
- A mathematical introduction to compressive sensing
- A new approach to variable selection in least squares problems
- A new simple homotopy algorithm for linear programming. I
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Convex Analysis
- DASSO: Connections Between the Dantzig Selector and Lasso
- Decoding by Linear Programming
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 52731 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Linear programming. Foundations and extensions
- On L1 and Chebyshev estimation
- Solving basis pursuit: heuristic optimality check and solver comparison
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The Homotopy Principle and Algorithms for Linear Programming
- Über diskrete und lineare Tschebyscheff-Approximationen
Cited in
(11)- Complexity and applications of the homotopy principle for uniformly constrained sparse minimization
- A simple homotopy proximal mapping algorithm for compressive sensing
- Dual periodicity in \(l_1\)-norm minimisation problems
- On primal and dual infeasibility certificates in a homogeneous model for convex optimization
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- The homotopy method revisited: computing solution paths of \(\ell_1\)-regularized problems
- Aggregate homotopy algorithm for robust sparse reconstruction problem
- A discrete dynamics approach to sparse calculation and applied in ontology science
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
- Cardinality minimization, constraints, and regularization: a survey
- Quasi-Newton L-BFGS based inexact primal-dual proximal point algorithms to solve nonsmooth convex composite programs for sparse signal recovery applications
This page was built for publication: A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639715)
