Decentralized inexact proximal gradient method with network-independent stepsizes for convex composite optimization
This paper proposes a novel CTA (Combine-Then-Adapt)-based decentralized algorithm for
solving convex composite optimization problems over undirected and connected networks …
solving convex composite optimization problems over undirected and connected networks …
A distributed proximal primal–dual algorithm for energy management with transmission losses in smart grid
This article aims to address the problem of distributed energy management for both the
generation and demand sides in smart grid. Different from many existing works, we …
generation and demand sides in smart grid. Different from many existing works, we …
Event-triggered primal–dual design with linear convergence for distributed nonstrongly convex optimization
This paper designs continuous-time algorithms with linear convergence for solving
distributed convex optimization problems without a strongly convex condition. The proposed …
distributed convex optimization problems without a strongly convex condition. The proposed …
A proximal ADMM-based distributed optimal energy management approach for smart grid with stochastic wind power
Y Zhou, X Shi, L Guo, G Wen… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
In this paper, we address a novel and comprehensive social welfare maximization (SWM)
problem for the optimal energy management in a smart grid. The objective is to maximize the …
problem for the optimal energy management in a smart grid. The objective is to maximize the …
Neurodynamic approaches for multi-agent distributed optimization
This paper considers a class of multi-agent distributed convex optimization with a common
set of constraints and provides several continuous-time neurodynamic approaches. In …
set of constraints and provides several continuous-time neurodynamic approaches. In …
Asynchronous Distributed Optimization with Delay-free Parameters
Existing asynchronous distributed optimization algorithms often use diminishing step-sizes
that cause slow practical convergence, or use fixed step-sizes that depend on and decrease …
that cause slow practical convergence, or use fixed step-sizes that depend on and decrease …
Decentralized Douglas-Rachford splitting methods for smooth optimization over compact submanifolds
We study decentralized smooth optimization problems over compact submanifolds.
Recasting it as a composite optimization problem, we propose a decentralized Douglas …
Recasting it as a composite optimization problem, we propose a decentralized Douglas …
Distributed sparsity constrained optimization over the Stiefel manifold
Distributed optimization aims to effectively complete specified tasks through cooperation
among multi-agent systems, which has achieved great success in large-scale optimization …
among multi-agent systems, which has achieved great success in large-scale optimization …
Distributed Proximal Alternating Direction Method of Multipliers for Constrained Composite Optimization Over Directed Networks
J Yan, X Shi, L Guo, Y Wan… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
In this article, we investigate a constrained composition optimization problem in a directed
communication network. Each agent is equipped with a local objective function composed of …
communication network. Each agent is equipped with a local objective function composed of …
Distributed stochastic proximal algorithm with random reshuffling for nonsmooth finite-sum optimization
The nonsmooth finite-sum minimization is a fundamental problem in machine learning. This
article develops a distributed stochastic proximal-gradient algorithm with random reshuffling …
article develops a distributed stochastic proximal-gradient algorithm with random reshuffling …