Parallel and distributed successive convex approximation methods for big-data optimization

DOI10.1007/978-3-319-97142-1_3zbMath1461.90101arXiv1805.06963OpenAlexW2803565980MaRDI QIDQ2312982

Ying Sun, Gesualdo Scutari

Publication date: 18 July 2019

Full work available at URL: https://arxiv.org/abs/1805.06963

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)

Related Items

Decentralized Dictionary Learning Over Time-Varying Digraphs, Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation, Distributed Variable Sample-Size Gradient-Response and Best-Response Schemes for Stochastic Nash Equilibrium Problems, Second-Order Guarantees of Distributed Gradient Algorithms, Distributed stochastic nonsmooth nonconvex optimization