Fetching the paper…
Reading the bibliography…
We develop two new proximal alternating penalty algorithms to solve a wide range class of constrained convex optimization problems.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovskii and D. Yudin · 1983
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
Practical Methods of Optimization
R. Fletcher · 1987
Earlier work this paper cites.
Applications of splitting algorithm to decomposition in convex programming and variational inequalities
P. Tseng · 1991
Earlier work this paper cites.
On the Douglas - Rachford splitting method and the proximal point algorithm for maximal monotone operators
J. Eckstein and D. Bertsekas · 1992
Earlier work this paper cites.
A proximal-based decomposition method for convex minimization problems
G. Chen and M. Teboulle · 1994
Earlier work this paper cites.
Nonlinear Programming
D.P. Bertsekas · 1999
Earlier work this paper cites.
Proximal decomposition via alternating linearization
K.C. Kiwiel, C. H. Rosa, and A. Ruszczyński · 1999
Earlier work this paper cites.
Lectures on modern convex optimization: Analysis, algorithms, and engineering applications
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
Interior gradient and proximal methods for convex and conic optimization
A. Auslender and M. Teboulle · 2006
Earlier work this paper cites.
Disciplined convex programming
M. Grant, S. Boyd, and Y. Ye · 2006
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S.J. Wright · 2006
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.
Interior-point Lagrangian decomposition method for separable convex optimization
I. Necoara and J.A.K. Suykens · 2009
Earlier work this paper cites.
A general framework for a class of first order primal-dual algorithms for TV-minimization
E. Esser, X. Zhang, and T. Chan · 2010
Earlier work this paper cites.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P.A. Parrilo · 2010
Cited alongside, same era.
Templates for convex cone problems with applications to sparse signal recovery
S. Becker, E. J. Candès, and M. Grant · 2011
Cited alongside, same era.
Square-root LASSO: Pivotal recovery of sparse signals via conic programming
A. Belloni, V. Chernozhukov, and L. Wang · 2011
Cited alongside, same era.
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.
Fast alternating linearization methods of minimization of the sum of two convex functions
Convergence rate analysis of primal-dual splitting schemes
D. Davis · 2015
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.
Adaptive Restart for Accelerated Gradient Schemes
B. O’Donoghue and E. Candes · 2015
Later among the works it cites.
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.
Construction and iteration-complexity of primal sequences in alternating minimization algorithms
Quoc Tran-Dinh · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Goldfarb, S. Ma, and K. Scheinberg · 2012
Cited alongside, same era.
Fast Alternating Direction Optimization Methods
T. Goldstein, B. O’Donoghue, and S. Setzer · 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.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Optimization for Machine Learning
S. Sra, S. Nowozin, and S. J. Wright · 2012
Cited alongside, same era.
A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
L. Condat · 2013
Cited alongside, same era.
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization
M. Jaggi · 2013
Cited alongside, same era.
Later among the works it cites.
Linear convergence of first order methods for non-strongly convex optimization
I. Necoara, Y. Nesterov, and F. Glineur · 2016
Later among the works it cites.
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
R. Shefi and M. Teboulle · 2016
Later among the works it cites.
Adaptive Smoothing Algorithms for Nonsmooth Composite Convex Minimization
Quoc Tran-Dinh · 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.
Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3 \alpha\leq 3
H. Attouch, Z. Chbani, and H. Riahi · 2017
Closest in time.
Convex analysis and monotone operators theory in Hilbert spaces
H. H. Bauschke and P. Combettes · 2017
Closest in time.
A Selective Linearization Method for Multiblock Convex Optimization
Y. Du, X. Lin, and A. Ruszczyński · 2017
Closest in time.
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
I. Necoara, A. Patrascu, and F. Glineur · 2017
Closest in time.
Smoothing technique for nonsmooth composite minimization with linear operator
V. Q. Nguyen, O. Fercoq, and V. Cevher · 2017
Closest in time.
Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
Y. Xu · 2017
Closest in time.
Self-Adaptive Double-Loop Primal-Dual Algorithm for Nonsmooth Convex Optimization
Q. Tran-Dinh, A. Alacaoglu, O. Fercoq, and V. Cevher · 2018
Closest in time.
A smooth primal-dual optimization framework for nonsmooth composite convex minimization
Q. Tran-Dinh, O. Fercoq, and V. Cevher · 2018
Closest in time.
Non-Ergodic Alternating Proximal Augmented Lagrangian Algorithms with Optimal Rates
Quoc Tran-Dinh and Y. Zhu · 2018
Closest in time.