Decentralized optimization over tree graphs
From MaRDI portal
Publication:2031996
Abstract: This paper presents a decentralized algorithm for non-convex optimization over tree-structured networks. We assume that each node of this network can solve small-scale optimization problems and communicate approximate value functions with its neighbors based on a novel multi-sweep communication protocol. In contrast to existing parallelizable optimization algorithms for non-convex optimization the nodes of the network are neither synchronized nor assign any central entity. None of the nodes needs to know the whole topology of the network, but all nodes know that the network is tree-structured. We discuss conditions under which locally quadratic convergence rates can be achieved. The method is illustrated by running the decentralized asynchronous multi-sweep protocol on a radial AC power network case study.
Recommendations
- Communication-efficient algorithms for decentralized and stochastic optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- Distributed composite optimization for multi-agent systems with asynchrony
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- Optimal convergence rates for convex distributed optimization in networks
Cites work
- A Distributed Optimization Algorithm for the Predictive Control of Smart Grids
- A dual Newton strategy for scenario decomposition in robust multistage MPC
- Abstract dynamic programming
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Approximate dynamic programming via iterated Bellman inequalities
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence Rate of Distributed ADMM Over Networks
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Cubic regularization of Newton method and its global performance
- Decentralized consensus optimization and resource allocation
- Decomposition methods based on augmented Lagrangians: a survey
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Exploiting structure in parallel implementation of interior point methods for optimization
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Neuro-Dynamic Programming: An Overview and Recent Results
- Nonlinear robust optimization via sequential convex bilevel programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Optimal control by dynamic programming using systematic reduction in grid size
- Quadratic approximate dynamic programming for input-affine systems
- Stabilizing Model Predictive Control of Stochastic Constrained Linear Systems
- Strongly Regular Generalized Equations
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- Using dynamic programming with adaptive grid scheme for optimal control problems in economics
Cited in
(4)
This page was built for publication: Decentralized optimization over tree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031996)
