# A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data

arXiv: https://arxiv.org/abs/1511.02746 · HTML: https://mlsanity.com/paper/1511.02746/

## Key facts

- Cited by 15 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Nov 2015.

## Built on by (most cited first, 15 of 15)

- [Neuro-Symbolic Causal Reasoning Meets Signaling Game for Emergent Semantic Communications](https://mlsanity.com/paper/2210.12040/) (2022)
- [UAV Communications for Sustainable Federated Learning](https://mlsanity.com/paper/2103.11073/) (2021)
- [Personalized Federated Learning via Convex Clustering](https://mlsanity.com/paper/2202.00718/) (2022)
- [Quantized Radio Map Estimation Using Tensor and Deep Generative Models](https://mlsanity.com/paper/2303.01770/) (2023)
- [Stochastic Mirror Descent for Low-Rank Tensor Decomposition Under Non-Euclidean Losses](https://mlsanity.com/paper/2104.14562/) (2021)
- [Sparse Graphical Linear Dynamical Systems](https://mlsanity.com/paper/2307.03210/) (2023)
- [Transient growth of accelerated optimization algorithms](https://mlsanity.com/paper/2103.08017/) (2021)
- [Learning Autonomy in Management of Wireless Random Networks](https://mlsanity.com/paper/2106.07984/) (2021)
- [Tradeoffs between convergence rate and noise amplification for momentum-based accelerated optimization algorithms](https://mlsanity.com/paper/2209.11920/) (2022)
- [FLSTRA: Federated Learning in Stratosphere](https://mlsanity.com/paper/2302.00163/) (2023)
- [Shape-from-Template with Generalised Camera](https://mlsanity.com/paper/2508.13791/) (2025)
- [A Structured Sparse Neural Network and Its Matrix Calculations Algorithm](https://mlsanity.com/paper/2207.00903/) (2022)
- [Adaptive Consensus: A network pruning approach for decentralized optimization](https://mlsanity.com/paper/2309.02626/) (2023)
- [Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms](https://mlsanity.com/paper/2405.03073/) (2024)
- [Optimization Problem Solving Can Transition to Evolutionary Agentic Workflows](https://mlsanity.com/paper/2505.04354/) (2025)

## Abstract (arXiv)

This article presents a powerful algorithmic framework for big data optimization, called the Block Successive Upper bound Minimization (BSUM). The BSUM includes as special cases many well-known methods for analyzing massive data sets, such as the Block Coordinate Descent (BCD), the Convex-Concave Procedure (CCCP), the Block Coordinate Proximal Gradient (BCPG) method, the Nonnegative Matrix Factorization (NMF), the Expectation Maximization (EM) method and so on. In this article, various features and properties of the BSUM are discussed from the viewpoint of design flexibility, computational efficiency, parallel/distributed implementation and the required communication overhead. Illustrative examples from networking, signal processing and machine learning are presented to demonstrate the practical performance of the BSUM framework