Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints

DOI10.1016/J.AUTOMATICA.2023.111309MaRDI QIDQ6537273zbMATH OpenFDO

Authors Yi Huang, Ziyang Meng, Jian Sun, Gang Wang

Publication date 14 May 2024

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2023.111309

zbMATH Keywords

coupled constraintsdistributed optimizationnonsmooth resource allocationproximal splitting

Mathematics Subject Classification ID

Convex programming (90C25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
• Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem
• Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
• Distributed algorithm for robust resource allocation with polyhedral uncertain allocation parameters
• Distributed resource allocation via multi-agent systems under time-varying networks

Cites work

• A Distributed Continuous-Time Algorithm for Nonsmooth Constrained Optimization
• A Proximal Gradient Algorithm for Decentralized Composite Optimization
• A Smooth Double Proximal Primal-Dual Algorithm for a Class of Distributed Nonsmooth Optimization Problems
• A three-operator splitting scheme and its optimization applications
• Continuous-Time Algorithm Based on Finite-Time Consensus for Distributed Constrained Convex Optimization
• Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
• Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
• Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
• Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
• Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization
• Distributed Nonsmooth Optimization with Coupled Inequality Constraints via Modified Lagrangian Function
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
• Distributed Smooth Convex Optimization With Coupled Constraints
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
• Initialization-free privacy-guaranteed distributed algorithm for economic dispatch problem
• Nonlinear systems.
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms

Cited in

(5)

• Distributed proximal‐gradient algorithms for nonsmooth convex optimization of second‐order multiagent systems
• A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
• Fixed-time safe distributed optimization for cost-coupled weighted economic dispatch over time-varying networks
• Fully distributed constrained optimization algorithm over unbalanced network and its application to smart grids
• Distributed proximal algorithms for constrained resource allocation over continuous and discrete communication

This page was built for publication: Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537273)