Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
From MaRDI portal
Recommendations
- Approximability of Sparse Integer Programs
- Approximability of sparse integer programs
- Sparse Approximate Solutions to Semidefinite Programs
- Approximation Bounds for Sparse Programs
- Sparse convex optimization toolkit: a mixed-integer framework
- Exact and approximate sparse solutions of underdetermined linear equations
- Sparse approximate solutions to max-plus equations
- Sparse solutions of a class of constrained optimization problems
- Exact and fast algorithms for mixed-integer nonlinear programming
- On solutions of sparsity constrained optimization
Cited in
(17)- Sparsity penalized mean-variance portfolio selection: analysis and computation
- Cardinality minimization, constraints, and regularization: a survey
- Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization
- A unified view of exact continuous penalties for _2-_0 minimization
- Global optimization for sparse solution of least squares problems
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Sparse convex optimization toolkit: a mixed-integer framework
- Projected gradient descent method for cardinality-constrained portfolio optimization
- Optimality conditions for sparse nonlinear programming
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Sparse signal reconstruction via collaborative neurodynamic optimization
- Exact continuous relaxations of _0-regularized criteria with non-quadratic data terms
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures
- Blind source separation based on mixed integer programming
- Feasibility pump algorithm for sparse representation under Laplacian noise
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
This page was built for publication: Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618248)
