Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems

DOI10.1109/TSP.2013.2293126zbMath1394.94507arXiv1302.0756OpenAlexW1974661392MaRDI QIDQ4578978

Gesualdo Scutari, Francisco Facchinei, Jong-Shi Pang, Peiran Song, Daniel P. Palomar

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Parallel algorithms in computer science (68W10)

Related Items

An incremental decomposition method for unconstrained optimization, Feasible methods for nonconvex nonsmooth problems with applications in green communications, Decentralized Dictionary Learning Over Time-Varying Digraphs, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, Decentralized multi-agent optimization based on a penalty method, Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case, Inexact partial linearization methods for network equilibrium problems, Distributed semi-supervised support vector machines, An adaptive partial linearization method for optimization problems on product sets, Randomness and permutations in coordinate descent methods, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Distributed nonconvex constrained optimization over time-varying digraphs, Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks, On the gradient method for solving multi-agent systems, Open issues and recent advances in DC programming and DCA, Asynchronous parallel algorithms for nonconvex optimization, Computing B-Stationary Points of Nonsmooth DC Programs, On the pervasiveness of difference-convexity in optimization and statistics, DC programming and DCA: thirty years of developments, Iteration complexity analysis of block coordinate descent methods, Variational inequality type formulations of general market equilibrium problems with local information, Non-cooperative games with minmax objectives, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Adaptive online distributed optimization in dynamic environments