Distributed nonconvex constrained optimization over time-varying digraphs
From MaRDI portal
Publication:2425183
DOI10.1007/s10107-018-01357-wzbMath1415.90130arXiv1809.01106OpenAlexW2892002891WikidataQ128388005 ScholiaQ128388005MaRDI QIDQ2425183
Publication date: 26 June 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.01106
Applications of mathematical programming (90C90) Noncooperative games (91A10) Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Decomposition methods (49M27) Numerical methods for variational inequalities and related problems (65K15)
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 ⋮ Subgradient averaging for multi-agent optimisation with different constraint sets ⋮ An event-triggering algorithm for decentralized stochastic optimization over networks ⋮ A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks ⋮ Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization ⋮ Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes ⋮ Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems ⋮ Decentralized optimization with affine constraints over time-varying networks ⋮ DIMIX: Diminishing Mixing for Sloppy Agents ⋮ EFIX: exact fixed point methods for distributed optimization ⋮ Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization ⋮ Second-Order Guarantees of Distributed Gradient Algorithms ⋮ Unnamed Item ⋮ Triggered gradient tracking for asynchronous distributed optimization ⋮ Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction
Uses Software
Cites Work
- Unnamed Item
- DC approximation approaches for sparse optimization
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing
- Coordinate descent algorithms
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
- An affine scaling methodology for best basis selection
- Distributed Optimization Over Time-Varying Directed Graphs
- Fast Distributed Gradient Methods
- Adaptation, Learning, and Optimization over Networks
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Gradient Convergence in Gradient methods with Errors
- Decentralized Frank–Wolfe Algorithm for Convex and Nonconvex Problems
- Diffusion LMS Strategies for Distributed Estimation
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication
- Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Non-Convex Distributed Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- Harnessing Smoothness to Accelerate Distributed Optimization
- Optimization Methods for Large-Scale Machine Learning
- 10.1162/153244303322753751
- Distributed Subgradient Methods for Multi-Agent Optimization
- On Distributed Averaging Algorithms and Quantization Effects
- Constrained Consensus and Optimization in Multi-Agent Networks
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
- Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization
- An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization
- ADD-OPT: Accelerated Distributed Directed Optimization
