Randomized first order algorithms with applications to \(\ell _{1}\)-minimization

DOI10.1007/s10107-012-0575-2zbMath1282.90128OpenAlexW2099676320WikidataQ57392887 ScholiaQ57392887MaRDI QIDQ2434980

Fatma Kılınç-Karzan, Arkadi Nemirovski, Anatoli B. Juditsky

Publication date: 3 February 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0575-2

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Minimax problems in mathematical programming (90C47) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, First-order methods for convex optimization, Online First-Order Framework for Robust Convex Optimization, Conditional gradient algorithms for norm-regularized smooth convex optimization, Unnamed Item, On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms, Solving variational inequalities with monotone operators on domains given by linear minimization oracles

Cites Work

• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Optimum bounds for the distributions of martingales in Banach spaces
• A sublinear-time randomized approximation algorithm for matrix games
• New variants of bundle methods
• Weighted sums of certain dependent random variables
• Nemirovski's Inequalities Revisited
• Decoding by Linear Programming
• Robust Stochastic Approximation Approach to Stochastic Programming
• Uncertainty principles and ideal atomic decomposition
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Solving variational inequalities with Stochastic Mirror-Prox algorithm
• Probability Inequalities for Sums of Bounded Random Variables