Fetching the paper…
Reading the bibliography…
We consider a primal-dual algorithm for minimizing $f(x)+h\square l(Ax)$ with Fr\'echet differentiable $f$ and $l^*$.
Journal of Mathematical Analysis and Applications 14
Petryshyn, W.: Construction of fixed points of demicompact mappings in Hilbert space · 1966
Earlier work this paper cites.
Springer Science & Business Media (2011)
Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces · 2011
Earlier work this paper cites.
Journal of Mathematical Imaging and Vision 40
Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging · 2011
Earlier work this paper cites.
Inverse Problems 27
Loris, I., Verhoeven, C.: On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty · 2011
Earlier work this paper cites.
Set-Valued and variational analysis 20
Combettes, P.L., Pesquet, J.C.: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators · 2012
Earlier work this paper cites.
SIAM Journal on Optimization 23
Bot, R.I., Hendrich, C.: A Douglas–Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators · 2013
Earlier work this paper cites.
Inverse Problems 29
Chen, P., Huang, J., Zhang, X.: A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration · 2013
Earlier work this paper cites.
Journal of Optimization Theory and Applications 158
Condat, L.: A primal–dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms · 2013
Earlier work this paper cites.
Advances in Computational Mathematics 38
Vũ, B.C.: A splitting algorithm for dual monotone inclusions involving cocoercive operators · 2013
Earlier work this paper cites.
Yang, J., Yuan, X.: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization · 2013
Earlier work this paper cites.
In: Advances in Neural Information Processing Systems, pp. 3068–3076 (2014)
Jaggi, M., Smith, V., Takác, M., Terhorst, J., Krishnan, S., Hofmann, T., Jordan, M.I.: Communication-efficient distributed dual coordinate ascent · 2014
Earlier work this paper cites.
Mathematical Programming 150
Boţ, R.I., Csetnek, E.R., Heinrich, A., Hendrich, C.: On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems · 2015
Cited alongside, same era.
Operations Research Letters 43
Drori, Y., Sabach, S., Teboulle, M.: A simple algorithm for a class of nonsmooth convex–concave saddle-point problems · 2015
Cited alongside, same era.
IEEE Signal Processing Magazine 32
Komodakis, N., Pesquet, J.C.: Playing with duality: An overview of recent primal-dual approaches for solving large-scale optimization problems · 2015
Cited alongside, same era.
IEEE Transactions on Signal Processing 63
Shi, W., Ling, Q., Wu, G., Yin, W.: A proximal gradient algorithm for decentralized composite optimization · 2015
Cited alongside, same era.
Acta Numerica 25
Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging · 2016
Cited alongside, same era.
Mathematical Programming 159
Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal–dual algorithm · 2016
arXiv preprint arXiv:1803.01401 (2018)
Hamedani, E.Y., Aybat, N.S.: A primal-dual algorithm for general convex-concave saddle point problems · 2018
Closest in time.
arXiv preprint arXiv:1806.04118 (2018)
Hamedani, E.Y., Jalilzadeh, A., Aybat, N., Shanbhag, U.: Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems · 2018
Closest in time.
IEEE Transactions on Signal and Information Processing over Networks 4
Wu, T., Yuan, K., Ling, Q., Yin, W., Sayed, A.H.: Decentralized consensus optimization with asynchrony and delays · 2018
Closest in time.
Journal of Scientific Computing 76
Yan, M.: A new primal-dual algorithm for minimizing the sum of three functions with a linear operator · 2018
Closest in time.
Journal of Computational and Graphical Statistics 28
Ko, S., Yu, D., Won, J.H.: Easily parallelizable and distributable class of algorithms for structured sparsity, with optimal acceleration · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fixed Point Theory and Applications 2016
Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions · 2016
Cited alongside, same era.
Applied and Computational Mathematics 15
Ryu, E.K., Boyd, S.: Primer on monotone operator methods · 2016
Cited alongside, same era.
Set-valued and variational analysis 25
Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications · 2017
Cited alongside, same era.
arXiv preprint arXiv:1711.03669 (2017)
Hien, L.T.K., Zhao, R., Haskell, W.B.: An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems · 2017
Cited alongside, same era.
Computational Optimization and Applications 68
Latafat, P., Patrinos, P.: Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators · 2017
Cited alongside, same era.
Closest in time.
arXiv preprint arXiv:1906.07225 (2019)
Li, Y., Yan, M.: On linear convergence of two decentralized algorithms · 2019
Closest in time.
IEEE Transactions on Signal Processing 67
Li, Z., Shi, W., Yan, M.: A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates · 2019
Closest in time.
IMA Journal of Numerical Analysis 40
He, B., Ma, F., Yuan, X.: Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems · 2020
Closest in time.
INFORMS Journal on Optimization to appear
Xu, Y.: First-order methods for constrained convex programming based on linearized augmented Lagrangian function · 2020
Closest in time.
SIAM Journal on Optimization 30
Xu, Y.: Primal-dual stochastic gradient method for convex programs with many functional constraints · 2020
Closest in time.