Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
From MaRDI portal
Abstract: This technical note considers a distributed convex optimization problem with nonsmooth cost functions and coupled nonlinear inequality constraints. To solve the problem, we first propose a modified Lagrangian function containing local multipliers and a nonsmooth penalty function. Then we construct a distributed continuous-time algorithm by virtue of a projected primal-dual subgradient dynamics. Based on the nonsmooth analysis and Lyapunov function, we obtain the existence of the solution to the nonsmooth algorithm and its convergence.
Cited in
(30)- Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
- Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs
- Distributed sub-optimal resource allocation via a projected form of singular perturbation
- A new look at distributed optimal output agreement of multi-agent systems
- Distributed resource allocation via multi-agent systems under time-varying networks
- Decentralized convex optimization under affine constraints for power systems control
- An adaptive penalty-like continuous-time algorithm to constrained distributed convex optimization
- Adaptive backstepping for distributed optimization
- Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variables
- Predefined-time optimization for distributed resource allocation
- Fractional differential equation approach for convex optimization with convergence rate analysis
- Distributed optimal load frequency control considering nonsmooth cost functions
- Surrogate-based distributed optimisation for expensive black-box functions
- Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
- Distributed consensus-based solver for semi-definite programming: an optimization viewpoint
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games
- Distributed optimization for multi-agent system over unbalanced graphs with linear convergence rate.
- A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems
- Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
- Distributed Nash equilibrium seeking with order-reduced dynamics based on consensus exact penalty
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
- Distributed solving linear algebraic equations with switched fractional order dynamics
- Optimal decentralized control of a wind turbine and diesel generator system
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
- Distributed continuous-time optimization for convex problems with coupling linear inequality constraints
- Event-triggered distributed optimisation for multi-agent systems with transmission delay
- Distributed dual averaging algorithm for multi-agent optimization with coupled constraints.
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
- Distributed resilient optimization control for uncertain nonlinear MASs under DoS attacks
This page was built for publication: Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375268)
