Randomized first order algorithms with applications to _1-minimization
From MaRDI portal
Publication:2434980
Recommendations
- Random algorithms for convex minimization problems
- scientific article; zbMATH DE number 1555182
- On solving large-scale polynomial convex problems by randomized first-order algorithms
- On first-order algorithms for \(\ell_{1}/\)nuclear norm minimization
- Random convex programs with L₁-regularization: sparsity and generalization
- Approximation algorithms for minimum norm and ordered optimization problems
- Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization
- New first-order algorithms for stochastic variational inequalities
- Stochastic first-order methods with random constraint projection
- scientific article; zbMATH DE number 887432
Cites work
- A new algorithm for estimating the effective dimension-reduction subspace
- A sublinear-time randomized approximation algorithm for matrix games
- Compressive sampling
- Decoding by Linear Programming
- Nemirovski's inequalities revisited
- New variants of bundle methods
- Optimum bounds for the distributions of martingales in Banach spaces
- Probability Inequalities for Sums of Bounded Random Variables
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Smooth minimization of non-smooth functions
- Solving variational inequalities with stochastic mirror-prox algorithm
- Uncertainty principles and ideal atomic decomposition
- Weighted sums of certain dependent random variables
Cited in
(9)- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- Random convex programs with L₁-regularization: sparsity and generalization
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- SVM via saddle point optimization: new bounds and distributed algorithms
- Online first-order framework for robust convex optimization
- On solving large-scale polynomial convex problems by randomized first-order algorithms
- On first-order algorithms for \(\ell_{1}/\)nuclear norm minimization
- First-order methods for convex optimization
This page was built for publication: Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434980)
