Approximation Bounds for Sparse Programs
From MaRDI portal
Publication:5073726
DOI10.1137/21M1398677zbMath1493.62092arXiv2102.06742OpenAlexW3131933343MaRDI QIDQ5073726
No author found.
Publication date: 3 May 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06742
Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Statistical ranking and selection procedures (62F07) Asymptotic theory of convex bodies (52A23)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounding duality gap for separable problems with linear constraints
- On general minimax theorems
- A semidefinite programming method for integer convex quadratic minimization
- Sparse learning via Boolean relaxations
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Optimal Cardinality Constrained Portfolio Selection
- A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem
- Decoding by Linear Programming
- Estimates of the Duality Gap in Nonconvex Optimization
- Sparse Approximate Solutions to Linear Systems
- Why Are Big Data Matrices Approximately Low Rank?
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- Quasi-Equilibria in Markets with Non-Convex Preferences
This page was built for publication: Approximation Bounds for Sparse Programs
