Subset Selection in Sparse Matrices
From MaRDI portal
Publication:4961001
DOI10.1137/18M1219266zbMath1441.90125arXiv1810.02757OpenAlexW3018085574MaRDI QIDQ4961001
Robert Weismantel, Alberto Del Pia, Santanu S. Dey
Publication date: 24 April 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02757
Related Items
Sparse approximation over the cube ⋮ A graph-based decomposition method for convex quadratic optimization with indicators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(N\)-fold integer programming
- Least angle regression. (With discussion)
- \(n\)-fold integer programming in cubic time
- Restricted strong convexity implies weak submodularity
- A polynomial case of the cardinality-constrained quadratic optimization problem
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- An Introduction to Network Flows over Time
- Integer Programming with a Fixed Number of Variables
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Algorithmic complexity: threeNP- hard problems in computational statistics
- Regressions by Leaps and Bounds
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Combinatorics of Compositions and Words
- Constructing Maximal Dynamic Flows from Static Flows
- Stable signal recovery from incomplete and inaccurate measurements
- Understanding Machine Learning
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Compressed sensing
This page was built for publication: Subset Selection in Sparse Matrices
