Global optimization for sparse solution of least squares problems
DOI10.1080/10556788.2021.1977809OpenAlexW2920819663MaRDI QIDQ5058393
Jordan Ninin, Ramzi Ben Mhenni, Sébastien Bourguignon
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1977809
homotopy continuationbranch-and-boundsubset selectionsparse approximationcontinuous relaxationcardinality constraint
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best subset selection via a modern optimization lens
- DC approximation approaches for sparse optimization
- Iterative thresholding for sparse approximations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Algorithm for cardinality-constrained quadratic optimization
- Concave programming for minimizing the zero-norm over polyhedral sets
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Computational study of a family of mixed-integer quadratic programming problems
- Least angle regression. (With discussion)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Optimal Cardinality Constrained Portfolio Selection
- Optimization with Sparsity-Inducing Penalties
- A concave optimization-based approach for sparse portfolio selection
- On a Reformulation of Mathematical Programs with Cardinality Constraints
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
- Sparse and Redundant Representations
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- A new approach to variable selection in least squares problems
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
- Homotopy Based Algorithms for $\ell _{\scriptscriptstyle 0}$-Regularized Least-Squares
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Sparse Approximate Solutions to Linear Systems
- Multicriteria Optimization
- Sparse Approximation via Penalty Decomposition Methods
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
This page was built for publication: Global optimization for sparse solution of least squares problems
