Trading accuracy for sparsity in optimization problems with sparsity constraints
From MaRDI portal
Recommendations
- Approximation hardness for a class of sparse optimization problems
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Least sparsity of \(p\)-norm based optimization problems with \(p>1\)
- Algorithms for sparsity-constrained optimization
- Greedy sparsity-constrained optimization
Cited in
(33)- Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
- Biorthogonal greedy algorithms in convex optimization
- Gradient projection Newton pursuit for sparsity constrained optimization
- Generalized greedy alternatives
- Greedy approximation in convex optimization
- Greedy strategies for convex optimization
- A greedy Newton-type method for multiple sparse constraint problem
- Algorithms for sparsity-constrained optimization
- Convex optimization on Banach spaces
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee
- Convergence and rate of convergence of some greedy algorithms in convex optimization
- Adaptive and optimal online linear regression on ^1-balls
- scientific article; zbMATH DE number 2012449 (Why is no real title available?)
- scientific article; zbMATH DE number 6982922 (Why is no real title available?)
- Sparse approximation by greedy algorithms
- Generalized conditional gradient for sparse estimation
- Greedy expansions in convex optimization
- Non-negative sparse regression and column subset selection with \(L_1\) error
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Sparse convex optimization via adaptively regularized hard thresholding
- Decomposable norm minimization with proximal-gradient homotopy algorithm
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Structured sparsity through convex optimization
- Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
- Statistical computational learning
- Brief introduction in greedy approximation
- Deviation optimal learning using greedy \(Q\)-aggregation
- On greedy approximation in complex Banach spaces
- The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
- Kernel-based L₂-boosting with structure constraints
- Nonlinear tensor product approximation of functions
This page was built for publication: Trading accuracy for sparsity in optimization problems with sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083309)
