Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
From MaRDI portal
Abstract: This technical note studies the distributed optimization problem of a sum of nonsmooth convex cost functions with local constraints. At first, we propose a novel distributed continuous-time projected algorithm, in which each agent knows its local cost function and local constraint set, for the constrained optimization problem. Then we prove that all the agents of the algorithm can find the same optimal solution, and meanwhile, keep the states bounded while seeking the optimal solutions. We conduct a complete convergence analysis by employing nonsmooth Lyapunov functions for the stability analysis of differential inclusions. Finally, we provide a numerical example for illustration.
Cited in
(51)- Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variables
- Convergence rates of inertial primal-dual dynamical methods for separable convex optimization problems
- Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
- Distributed optimization under edge agreements: a continuous-time algorithm
- Hierarchically distributed optimization with a flexible and complexity-reducing algorithm
- Distributed constraint optimization with flocking behavior
- Triggered gradient tracking for asynchronous distributed optimization
- Initialization-free optimization algorithm for interval-valued distributed optimization
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
- A unifying convex analysis and switching system approach to consensus with undirected communication graphs
- Stability analysis of distributed convex optimization under persistent attacks: a hybrid systems approach
- Distributed optimization with inexact oracle
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Event-triggered distributed optimisation for multi-agent systems with transmission delay
- Stochastic mirror descent for convex optimization with consensus constraints
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
- Achieving optimal output consensus for discrete-time linear multi-agent systems with disturbance rejection
- Distributed optimisation design for solving the Stein equation with constraints
- A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles
- A distributed optimization algorithm over Markov switching topology under adversarial attack
- Multi-cluster distributed optimization via random sleep strategy
- Distributed hybrid impulsive algorithm with supervisory resetting for nonlinear optimization problems
- Neural‐network‐based constrained optimal coordination for heterogeneous uncertain nonlinear multi‐agent systems
- A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
- Distributed multi-UAV trajectory optimization over directed networks
- Mass-spring-damper networks for distributed optimization in non-Euclidean spaces
- Exponentially Convergent Algorithm Design for Constrained Distributed Optimization via Nonsmooth Approach
- Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
- Distributed resource allocation of second‐order nonlinear multiagent systems
- Optimal consensus for uncertain high‐order multi‐agent systems by output feedback
- Distributed solving linear algebraic equations with switched fractional order dynamics
- Stochastic dual dynamical systems for linear equality constrained convex optimization problems
- Distributed dual averaging algorithm for multi-agent optimization with coupled constraints.
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- A multi-scale method for distributed convex optimization with constraints
- Distributed Continuous-Time Algorithms for Time-Varying Constrained Convex Optimization
- Primal-dual -subgradient method for distributed optimization
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Distributed continuous-time accelerated neurodynamic approaches for sparse recovery via smooth approximation to L₁-minimization
- Distributed predefined-time algorithms for optimal solution seeking in multi-agent systems subject to input disturbances
- Fully distributed constrained optimization algorithm over unbalanced network and its application to smart grids
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information
- Distributed optimal load frequency control considering nonsmooth cost functions
- Distributed constrained optimization via continuous-time mirror design
- Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network
This page was built for publication: Distributed Continuous-Time Algorithm for Constrained Convex Optimizations via Nonsmooth Analysis Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566897)
