Cardinality-constrained structured data-fitting problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Spectral Bundle Method for Semidefinite Programming
- A second-order bundle method to minimize the maximum eigenvalue function.
- An interior-point method for large-scale l₁-regularized logistic regression
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Convex Analysis
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Convex multi-task feature learning
- Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lasso
- Exact Regularization of Convex Programs
- Explicit sensor network localization using semidefinite representations and facial reductions
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Foundations of gauge and perspective duality
- Gap safe screening rules for sparsity enforcing penalties
- High-dimensional graphs and variable selection with the Lasso
- Identifying active manifolds in regularization problems
- Julia: a fresh approach to numerical computing
- Level-set methods for convex optimization
- Low-rank spectral optimization via gauge duality
- Model Selection and Estimation in Regression with Grouped Variables
- On the Identification of Active Constraints
- Phase retrieval via matrix completion
- Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
- Polar deconvolution of mixed signals
- Probing the Pareto frontier for basis pursuit solutions
- Regularization techniques for learning with matrices
- Robust principal component analysis?
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Safe Feature Elimination in Sparse Supervised Learning
- Sparse Optimization with Least-Squares Constraints
- Spectral regularization algorithms for learning large incomplete matrices
- The convex geometry of linear inverse problems
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
This page was built for publication: Cardinality-constrained structured data-fitting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584338)
