Fetching the paper…
Reading the bibliography…
{We consider alternating minimization procedures for convex optimization problems with variable divided in many block, each block being amenable for minimization with respect to its variable with freezed other variables blocks.
1906
Earlier work this paper cites.
Richard Gordon, Robert Bender and Gabor T. Herman, Algebraic Reconstruction Techniques (ART) for three-dimensional electron microscopy and X-ray photography, Journal of Theoretical Biology 29
1970
Earlier work this paper cites.
Imre Csiszár and Gábor E. Tusnády, Information geometry and alternating minimization procedures, 1984
1984
Earlier work this paper cites.
Y. Vardi, L. A. Shepp and L. Kaufman, A Statistical Model for Positron Emission Tomography, Journal of the American Statistical Association 80
1985
Earlier work this paper cites.
K. Lange, M. Bahn and R. Little, A Theoretical Study of Some Maximum Likelihood Algorithms for Emission and Transmission Tomography, IEEE Transactions on Medical Imaging 6
1987
Earlier work this paper cites.
Boris Polyak, Introduction to Optimization , New York, Optimization Software, 1987
1987
Earlier work this paper cites.
Dimitri P. Bertsekas and John N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods , Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1989
1989
Earlier work this paper cites.
Zhi-Quan Luo and Paul Tseng, Error bounds and convergence analysis of feasible descent methods: a general approach, Annals of Operations Research 46
1993
Earlier work this paper cites.
Charles Byrne, Iterative Reconstruction Algorithms Based on Cross-Entropy Minimization, in: Image Models (and their Speech Model Cousins) (Stephen E. Levinson and Larry Shepp, eds.), pp. 1–11, Springer New York, New York, NY, 1996
1996
Earlier work this paper cites.
James M. Ortega and Werner C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables , Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000
2000
Cited alongside, same era.
Curtis R Vogel, Computational methods for inverse problems , 23, Siam, 2002
2002
Cited alongside, same era.
Yurii Nesterov and Boris Polyak, Cubic regularization of Newton method and its global performance, Math. Program. 108
2006
Cited alongside, same era.
2013
Cited alongside, same era.
Charles L Byrne, Iterative optimization in inverse problems , CRC Press, 2014
2014
Cited alongside, same era.
Andreas Andresen and Vladimir Spokoiny, Convergence of an Alternating Maximization Procedure, Journal of Machine Learning Research 17
2016
Later among the works it cites.
M. Hong, M. Razaviyayn, Z. Luo and J. Pang, A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing, IEEE Signal Processing Magazine 33
2016
Later among the works it cites.
Hamed Karimi, Julie Nutini and Mark Schmidt, Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition , 2016
2016
Later among the works it cites.
Amir. Beck, First-Order Methods in Optimization , Society for Industrial and Applied Mathematics, Philadelphia, PA, 2017
2017
Later among the works it cites.
Antonin Chambolle, Pauline Tan and Samuel Vaiter, Accelerated Alternating Descent Methods for Dykstra-Like Problems, Journal of Mathematical Imaging and Vision 59
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yurii Nesterov, Introductory Lectures on Convex Optimization: A Basic Course , 1 ed, Springer Publishing Company, Incorporated, 2014
2014
Cited alongside, same era.
Amir. Beck, On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes, SIAM Journal on Optimization 25
2015
Cited alongside, same era.
Julie Nutini, Mark Schmidt, Issam Laradji, Michael Friedlander and Hoyt Koepke, Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection, in: Proceedings of the 32nd International Conference on Machine Learning (Francis Bach and David Blei, eds.), Proceedings of Machine Learning Research 37, pp. 1632–1641, PMLR, Lille, France, 07–09 Jul 2015
2015
Cited alongside, same era.
Ruoyu Sun and Mingyi Hong, Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems, in: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 , NIPS’15, pp. 1306–1314, MIT Press, Cambridge, MA, USA, 2015
2015
Cited alongside, same era.
2017
Later among the works it cites.
Mingyi Hong, Xiangfeng Wang, Meisam Razaviyayn and Zhi-Quan Luo, Iteration complexity analysis of block coordinate descent methods, Mathematical Programming 163
2017
Later among the works it cites.
Jelena Diakonikolas and Lorenzo Orecchia, Alternating Randomized Block Coordinate Descent, in: Proceedings of the 35th International Conference on Machine Learning (Jennifer Dy and Andreas Krause, eds.), Proceedings of Machine Learning Research 80, pp. 1224–1232, PMLR, Stockholmsmässan, Stockholm Sweden, 10–15 Jul 2018
2018
Later among the works it cites.
Yurii Nesterov, Alexander Gasnikov, Sergey Guminov and Pavel Dvurechensky, Primal-dual accelerated gradient methods with small-dimensional relaxation oracle , 2018
2018
Later among the works it cites.
Nan Ye, Farbod Roosta-Khorasani and Tiangang Cui, Optimization Methods for Inverse Problems , pp. 121–140, 01 2019
2019
Closest in time.