Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs

DOI10.1016/j.automatica.2018.11.056zbMath1415.93040OpenAlexW2903605876WikidataQ128737565 ScholiaQ128737565MaRDI QIDQ1737711

George Yin, Shu Liang, L. Y. Wang

Publication date: 24 April 2019

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2018.11.056

zbMATH Keywords

directed graphdistributed optimizationnonsmooth convex optimizationquasi-monotone subgradient algorithm

Mathematics Subject Classification ID

Related Items (9)

Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization ⋮ Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach ⋮ Subgradient averaging for multi-agent optimisation with different constraint sets ⋮ Distributed optimization of multi-integrator agent systems with mixed neighbor interactions ⋮ Distributed optimization without boundedness of gradients for second-order multi-agent systems over unbalanced network ⋮ Regularized quasi-monotone method for stochastic optimization ⋮ Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Distributed multi-UAV trajectory optimization over directed networks

Cites Work

• Primal-dual subgradient methods for convex problems
• Distributed strategies for generating weight-balanced and doubly stochastic digraphs
• Distributed stochastic subgradient projection algorithms for convex optimization
• Average consensus on general strongly connected digraphs
• Quasi-monotone subgradient methods for nonsmooth convex minimization
• Distributed Optimization Over Time-Varying Directed Graphs
• Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
• Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
• Variational Analysis
• Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
• Distributed Subgradient Projection Algorithm Over Directed Graphs
• Distributed Subgradient Methods for Multi-Agent Optimization
• Constrained Consensus and Optimization in Multi-Agent Networks
• On Distributed Convex Optimization Under Inequality and Equality Constraints
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs
• Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
• On a Class of Directed Graphs—With an Application to Traffic-Flow Problems

This page was built for publication: Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs