Fetching the paper…
Reading the bibliography…
We propose a new self-adaptive, double-loop smoothing algorithm to solve composite, nonsmooth, and constrained convex optimization problems.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovskii and D. Yudin · 1983
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
G. Chen and M. Teboulle · 1993
Earlier work this paper cites.
Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming
J. Eckstein · 1993
Earlier work this paper cites.
Constrained Optimization and Lagrange Multiplier Methods
Dimitri P. Bertsekas · 1996
Earlier work this paper cites.
Proximal minimization methods with generalized Bregman functions
K. C. Kiwiel · 1997
Earlier work this paper cites.
Atomic decomposition by basis pursuit
Scott Shaobing Chen, David L Donoho, and Michael A Saunders · 2001
Earlier work this paper cites.
From few to many: Illumination cone models for face recognition under variable lighting and pose
Athinodoros S. Georghiades, Peter N. Belhumeur, and David J. Kriegman · 2001
Earlier work this paper cites.
Can we learn to beat the best stock
Allan Borodin, Ran El-Yaniv, and Vincent Gogan · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
1-norm support vector machines
Ji Zhu, Saharon Rosset, Robert Tibshirani, and Trevor J Hastie · 2004
Earlier work this paper cites.
Excessive gap technique in nonsmooth convex minimization
Y. Nesterov · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
Emmanuel J Candès, Justin Romberg, and Terence Tao · 2006
Earlier work this paper cites.
Compressed sensing
David L Donoho · 2006
Earlier work this paper cites.
Robust regression shrinkage and consistent variable selection through the lad-lasso
Hansheng Wang, Guodong Li, and Guohua Jiang · 2007
Earlier work this paper cites.
Applications of a smoothing technique to decomposition in convex optimization
I. Necoara and J.A.K. Suykens · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding agorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Sparse and stable markowitz portfolios
Joshua Brodie, Ingrid Daubechies, Christine De Mol, Domenico Giannone, and Ignace Loris · 2009
Earlier work this paper cites.
Sparse subspace clustering
Ehsan Elhamifar and René Vidal · 2009
Earlier work this paper cites.
Convex functions: constructions, characterizations and counterexamples
Jonathan M Borwein, Jon D Vanderwerff, et al · 2010
Earlier work this paper cites.
Primal-dual algorithm for convex models and applications to image restoration, registration and nonlocal inpainting
J. E. Esser · 2010
Earlier work this paper cites.
Convex analysis and monotone operators theory in Hilbert spaces
H.H. Bauschke and P. Combettes · 2011
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein · 2011
Cited alongside, same era.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Cited alongside, same era.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Cited alongside, same era.
Signal recovery by proximal forward-backward splitting
P. Combettes and Pesquet J.-C · 2011
Cited alongside, same era.
Primal-dual first-order methods with iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato DC Monteiro · 2011
Cited alongside, same era.
Learning word vectors for sentiment analysis
Andrew L. Maas, Raymond E. Daly, Peter T. Pham, Dan Huang, Andrew Y. Ng, and Christopher Potts · 2011
Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
R. Shefi and M. Teboulle · 2014
Later among the works it cites.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
W. Su, S. Boyd, and E. Candes · 2014
Later among the works it cites.
Convergence rate analysis of the forward-Douglas-Rachford splitting scheme
D. Davis · 2015
Later among the works it cites.
Ion Necoara, Andrei Patrascu, and Francois Glineur · 2015
Later among the works it cites.
Adaptive Restart for Accelerated Gradient Schemes
B. O’Donoghue and E. Candes · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Smoothing and first order methods: A unified framework
A. Beck and M. Teboulle · 2012
Cited alongside, same era.
A variable smoothing algorithm for solving convex optimization problems
Radu Ioan Boţ and Christopher Hendrich · 2012
Cited alongside, same era.
Double smoothing technique for large-scale linearly constrained convex optimization
O. Devolder, F. Glineur, and Y. Nesterov · 2012
Cited alongside, same era.
On the O ( 1 / n ) {O}(1/n) convergence rate of the Douglas-Rachford alternating direction method
B.S. He and X.M. Yuan · 2012
Cited alongside, same era.
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
R.I. Bot and C. Hendrich · 2013
Cited alongside, same era.
A primal–dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms
Laurent Condat · 2013
Cited alongside, same era.
An accelerated linearized alternating direction method of multiplier
Y. Ouyang, Y. Chen, G. Lan, and E. JR. Pasiliao · 2015
Later among the works it cites.
An accelerated linearized alternating direction method of multipliers
Yuyuan Ouyang, Yunmei Chen, Guanghui Lan, and Eduardo Pasiliao Jr · 2015
Later among the works it cites.
On the ergodic convergence rates of a first-order primal–dual algorithm
A. Chambolle and T. Pock · 2016
Later among the works it cites.
Restarting accelerated gradient methods with a rough strong convexity estimate
O. Fercoq and Z. Qu · 2016
Later among the works it cites.
Iteration-complexity of first-order augmented lagrangian methods for convex programming
Guanghui Lan and Renato DC Monteiro · 2016
Later among the works it cites.
H. Li and Z. Lin · 2016
Later among the works it cites.
Generating bags of words from the sums of their word embeddings
Lyndon White, Roberto Togneri, Wei Liu, and Mohammed Bennamoun · 2016
Later among the works it cites.
Tight complexity bounds for optimizing composite objectives
B. E. Woodworth and N. Srebro · 2016
Later among the works it cites.
Homotopy smoothing for non-smooth problems with lower complexity than o ( 1 / ϵ ) o(1/\epsilon)
Yi Xu, Yan Yan, Qihang Lin, and Tianbao Yang · 2016
Later among the works it cites.
First-order algorithms for convex optimization with nonseparable objective and coupled constraints
Xiang Gao and Shu-Zhong Zhang · 2017
Later among the works it cites.
Proximal Alternating Penalty Algorithms for Constrained Convex Optimization
Q. Tran-Dinh · 2017
Later among the works it cites.
A smooth primal-dual optimization framework for nonsmooth composite convex minimization
Q. Tran-Dinh, O. Fercoq, and V. Cevher · 2017
Later among the works it cites.
Smoothing technique for nonsmooth composite minimization with linear operator
Quang Van Nguyen, Olivier Fercoq, and Volkan Cevher · 2017
Later among the works it cites.
A new alternating direction method for linear programming
Sinong Wang and Ness Shroff · 2017
Later among the works it cites.
Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
Yangyang Xu · 2017
Later among the works it cites.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Yangyang Xu · 2017
Later among the works it cites.
A compressed sensing view of unsupervised text embeddings, bag-of-n-grams, and LSTMs
Sanjeev Arora, Mikhail Khodak, Nikunj Saunshi, and Kiran Vodrahalli · 2018
Closest in time.
Efficient solvers for sparse subspace clustering
Farhad Pourkamali-Anaraki and Stephen Becker · 2018
Closest in time.