Fetching the paper…
Reading the bibliography…
We consider the unconstrained optimization problem whose objective function is composed of a smooth and a non-smooth conponents where the smooth component is the expectation a random function.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Robert Tibshirani · 1996
Earlier work this paper cites.
Applications of second-order cone programming
Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd, and Herve Lebret · 1998
Earlier work this paper cites.
Fundamentals of Convex Analysis
Jean-Baptiste Hiriart-Urruty and Claude Lemarechal · 2001
Earlier work this paper cites.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2003
Earlier work this paper cites.
Introductory lectures on convex optimization: a basic course
Yurii Nesterov · 2003
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yurii Nesterov · 2005
Earlier work this paper cites.
Interior gradient and proximal methods for convex and conic optimization
Alfred Auslender and Marc Teboulle · 2006
Earlier work this paper cites.
Model selection and estimation in regression with grouped variables
Ming Yuan and Yi Lin · 2006
Earlier work this paper cites.
The group lasso for logistic regression
Lukas Meier, Sara van de Geer, and Peter Buhlmann · 2008
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
Cited alongside, same era.
Accelerated gradient methods for stochastic optimization and online learning
Chonghai Hu, James T. Kwok, and Weike Pan · 2009
Cited alongside, same era.
Group lasso with overlap and graph lasso
Laurent Jacob, Guillaume Obozinski, and Jean-Philippe Vert · 2009
Cited alongside, same era.
Structured variable selection with sparsity-inducing norms
Rodolphe Jenatton, Jean-Yves Audibert, and Francis Bach · 2009
Cited alongside, same era.
Primal-dual first-order methods with o ( 1 / ϵ ) o(1/\epsilon) iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato D. C. Monteiro · 2009
A coordinate gradient descent method for nonsmooth separable minimization
Paul Tseng and Sangwoon Yun · 2009
Later among the works it cites.
Graph-structured multi-task regression and an efficient optimization method for general fused lasso
Xi Chen, Qihang Lin, Seyoung Kim, Eric P. Xing, and Jaime G. Carbonell · 2010
Closest in time.
An efficient proximal-gradient method for single and multi-task regression with structured sparsity
Xi Chen, Qihang Lin, Seyoung Kim, Eric P. Xing, Javier Pena, and Jaime G. Carbonell · 2010
Closest in time.
Regularization paths for generalized linear models via coordinate descent
Jerome Friedman, Trevor Hastie, and Rob Tibshirani · 2010
Closest in time.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization
S. Ghadimi and G. Lan · 2010
Closest in time.
An optimal method for stochastic composite optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Multi-task feature learning via efficient ℓ 1 / ℓ 2 \ell_{1}/\ell_{2} norm minimization
Jun Liu, Shuiwang Ji, and Jieping Ye · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
K.-C. Toh and S. Yun · 2009
Cited alongside, same era.
Guanghui Lan · 2010
Closest in time.
Trace norm regularization: Reformulations, algorithms, and multi-task learning
Ting Kei Pong, Paul Tseng, Shuiwang Ji, , and Jieping Ye · 2010
Closest in time.
Proximal methods for sparse hierarchical dictionary learning
Guillaume Obozinski Francis Bach Rodolphe Jenatton, Julien Mairal · 2010
Closest in time.
Sparsity and smoothness via the fused lasso
Robert Tibshirani and Michael Saunders · 2059
Closest in time.