Fetching the paper…
Reading the bibliography…
We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity operator with respect to the non-smooth term.
Monotone operators and the proximal point algorithm
R.T. Rockafellar · 1976
Earlier work this paper cites.
New proximal point algorithms for convex minimization
O. Güler · 1992
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: A general approach
Z.-Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
A unified framework of descent algorithms for nonlinear programs and variational inequalities
M. Patriksson · 1995
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S.S. Chen, D.L. Donoho, and M.A. Saunders · 1998
Earlier work this paper cites.
Convergence rate of incremental subgradient algorithms
A. Nedic and D. Bertsekas · 2000
Earlier work this paper cites.
Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching
M.J. Wainwright, T.S. Jaakkola, and A.S. Willsky · 2003
Earlier work this paper cites.
Convex Analysis and Optimization
D.P. Bertsekas, A. Nedić, and A.E. Ozdaglar · 2003
Earlier work this paper cites.
Solving monotone inclusions via compositions of nonexpansive averaged operators
P.L. Combettes · 2004
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Online learning with kernels
J. Kivinen, A.J. Smola, and R.C. Williamson · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Earlier work this paper cites.
Smooth optimization with approximate gradient
A. d’Aspremont · 2008
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization, 2008
P. Tseng · 2008
Cited alongside, same era.
A Dykstra-like algorithm for two monotone operators
H.H. Bauschke and P.L. Combettes · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Sparse reconstruction by separable approximation
S.J. Wright, R.D. Nowak, and M.A.T. Figueiredo · 2009
Cited alongside, same era.
Group Lasso with overlap and graph Lasso
L. Jacob, G. Obozinski, and J.-P. Vert · 2009
Cited alongside, same era.
Convex structure learning in log-linear models: Beyond pairwise potentials
M. Schmidt and K. Murphy · 2010
Later among the works it cites.
Convex optimization with sparsity-inducing norms
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2011
Closest in time.
Total variation projection with first order schemes
J. Fadili and G. Peyré · 2011
Closest in time.
Fixed point and Bregman iterative methods for matrix rank minimization
S. Ma, D. Goldfarb, and L. Chen · 2011
Closest in time.
Proximal methods for sparse hierarchical dictionary learning
R. Jenatton, J. Mairal, G. Obozinski, and F. Bach · 2011
Closest in time.
Fast Newton-type methods for total variation regularization
A. Barbero and S. Sra · 2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Efficient online and batch learning using forward backward splitting
J. Duchi and Y. Singer · 2009
Cited alongside, same era.
Sparse online learning via truncated gradient
J. Langford, L. Li, and T. Zhang · 2009
Cited alongside, same era.
Estimate sequence methods: extensions and approximations
M. Baes · 2009
Cited alongside, same era.
Convex optimization theory
D.P. Bertsekas · 2009
Cited alongside, same era.
Subsampling algorithms for semidefinite programming
A. d’Aspremont · 2009
Cited alongside, same era.
Graph-structured multi-task regression and an efficient optimization method for general fused Lasso
X. Chen, S. Kim, Q. Lin, J.G. Carbonell, and E.P. Xing · 2010
Cited alongside, same era.
First-order methods of smooth convex optimization with inexact oracle
O. Devolder, F. Glineur, and Y. Nesterov · 2011
Closest in time.
Hybrid deterministic-stochastic methods for data fitting
M.P. Friedlander and M. Schmidt · 2011
Closest in time.
Accelerated and inexact forward-backward algorithms
S. Villa, S. Salzo, L. Baldassarre, and A. Verri · 2011
Closest in time.
An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
K. Jiang, D. Sun, and K.C. Toh · 2011
Closest in time.
Convex and network flow optimization for structured sparsity
J. Mairal, R. Jenatton, G. Obozinski, and F. Bach · 2011
Closest in time.
Proximal splitting methods in signal processing
P.L. Combettes and J.-C. Pesquet · 2011
Closest in time.
Projected Newton-type methods in machine learning
M. Schmidt, D. Kim, and S. Sra · 2011
Closest in time.