Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
From MaRDI portal
Publication:1694193
DOI10.1155/2017/3610283zbMath1380.93081OpenAlexW2772021806MaRDI QIDQ1694193
Changzhi Wu, Chuanye Gu, Jueyou Li, Zhi-You Wu
Publication date: 1 February 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/3610283
inequality constraintsexact penalty functionnetwork-structured optimization problemsnonconvex distributed optimization problem
Applications of optimal control and differential games (49N90) Combinatorial optimization (90C27) Transformations (93B17)
Related Items (2)
Distributed constraint optimization with flocking behavior ⋮ Distributed convex optimization with coupling constraints over time-varying directed graphs
Cites Work
- Unnamed Item
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed average consensus with least-mean-square deviation
- Discrete-time dynamic average consensus
- Gradient-free method for nonsmooth distributed optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Necessary and sufficient conditions for a penalty method to be exact
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Distributed Subgradient Methods for Multi-Agent Optimization
- Constrained Consensus and Optimization in Multi-Agent Networks
- DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS
- Distributed Subgradient Methods for Convex Optimization Over Random Networks
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
This page was built for publication: Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks