The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Open accessAbstract
The block coordinate descent (BCD) method is widely used for minimizing a continuous function $f$ of several block variables. At each iteration of this method, a single block of variables is optimized, while the remaining variables are held fixed. To ensure the convergence of the BCD method, the subproblem of each block variable needs to be solved to its unique global optimal. Unfortunately, this requirement is often too restrictive for many practical scenarios. In this paper, we study an alternative inexact BCD approach which updates the variable blocks by successively minimizing a sequence of approximations of $f$ which are either locally tight upper bounds of $f$ or strictly convex local approximations of $f$. The main contributions of this work include the characterizations of the convergence conditions for a fairly wide class of such methods, especially for the cases where the objective functions are either nondifferentiable or nonconvex. Our results unify and extend the existing convergence results for many classical algorithms such as the BCD method, the difference of convex functions (DC) method, the expectation maximization (EM) algorithm, as well as the block forward-backward splitting algorithm, all of which are popular for large scale optimization problems involving big data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
The expectation-maximization algorithm
Moon, T. K. (1996) · IEEE Signal Processing Magazine · doi:10.1109/79.543975 · Cited by 3,181
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Harshman, R. A. (1970) · Cited by 2,255
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Wright, S. J. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0892-3 · Cited by 1,438
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
Weighted Sum-Rate Maximization for Reconfigurable Intelligent Surface Aided Wireless Networks
Guo, H., Liang, Y.-C., Chen, J., & Larsson, E. G. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2970061 · Cited by 1,013
Joint Optimization of Radio and Computational Resources for Multicell Mobile-Edge Computing
Sardellitti, S., Scutari, G., & Barbarossa, S. (2015) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2015.2448520 · Cited by 891
Hong, M., Luo, Z.-Q., & Razaviyayn, M. (2016) · SIAM Journal on Optimization · doi:10.1137/140990309 · Cited by 841
Self-citationUser-Centric Cell-Free Massive MIMO Networks: A Survey of Opportunities, Challenges and Solutions
Ammar, H. A., Adve, R., Shahbazpanahi, S., Boudreau, G., & Srinivas, K. V. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3135119 · Cited by 460
Hong, M., Razaviyayn, M., Luo, Z.-Q., & Pang, J.-S. (2016) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2481563 · Cited by 447
Self-citationJoudeh, H., & Clerckx, B. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2603991 · Cited by 432
Optimization Methods for Designing Sequences With Low Autocorrelation Sidelobes
Song, J., Babu, P., & Palomar, D. P. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2425808 · Cited by 382
Intelligent Reflecting Surface Aided Multigroup Multicast MISO Communication Systems
Zhou, G., Pan, C., Ren, H., Wang, K., & Nallanathan, A. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2990098 · Cited by 353
DC programming and DCA: thirty years of developments
Le Thi, H. A., & Pham Dinh, T. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1235-y · Cited by 348
Buzzi, S., D'Andrea, C., Zappone, A., & D'Elia, C. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2952117 · Cited by 348
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
Sequence Design to Minimize the Weighted Integrated and Peak Sidelobe Levels
Song, J., Babu, P., & Palomar, D. P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2510982 · Cited by 312
Guaranteed Matrix Completion via Non-Convex Factorization
Sun, R., & Luo, Z.-Q. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2598574 · Cited by 309
Self-citationMatrix Completion and Low-Rank SVD via Fast Alternating Least Squares
Hastie, T. J., Mazumder, R., Lee, J. D., & Zadeh, R. B. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.2596 · Cited by 291
A Globally Convergent Algorithm for Nonconvex Optimization Based on Block Coordinate Update
Xu, Y., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-017-0376-0 · Cited by 285
Shi, Q., & Hong, M. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3001906 · Cited by 283
Self-citationJoint Beamforming and Power-Splitting Control in Downlink Cooperative SWIPT NOMA Systems
Xu, Y., Shen, C., Ding, Z., Sun, X., Yan, S., Zhu, G., & Zhong, Z. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2715008 · Cited by 280
Transmit Waveform/Receive Filter Design for MIMO Radar With Multiple Waveform Constraints
Wu, L., Babu, P., & Palomar, D. P. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2787115 · Cited by 256
Distributed Variational Representation Learning
Aguerri, I. E., & Zaidi, A. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2928806 · Cited by 84
“Since LsðPÞ and L s ðP;Q ðP0ÞÞ satisfy [67, Proposition 1], then L s ðP;Q ðP0ÞÞ satisfies A1-A4 in [67].”
BackgroundHybrid Beamforming for Massive MIMO Over-the-Air Computation
Zhai, X., Chen, X., Xu, J., & Kwan Ng, D. W. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3051397 · Cited by 74
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Fully Decentralized Joint Learning of Personalized Models and Collaboration Graphs
Zantedeschi, V., Bellet, A., & Tommasi, M. (2019) · arXiv · doi:10.48550/arxiv.1901.08460 · Cited by 38
LBSCA: Learning Real-time Power System State Estimation Under Hidden Adversarial Attacks
Basulaiman, K., Albeladi, F., Almutairi, F. M., Saeed, A., & Barati, M. (2025) · IEEE Access · doi:10.1109/access.2025.3610609 · Cited by 6
Behrouz, A., Razaviyayn, M., Zhong, P., & Mirrokni, V. (2025) · arXiv · doi:10.48550/arxiv.2504.13173 · Cited by 65
Self-citation
Metadata
- Authors
- Razaviyayn, M., Hong, M., & Luo, Z.-Q.
- Venue
- SIAM Journal on Optimization
- Published
- 2013-01
- Volume
- 23
- Issue
- 2
- Pages
- 1126-1153
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2050968963
- Cited by
- 1,304
- References
- 31
- FWCI
- 79.31
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.