Decentralized inexact proximal gradient method with network-independent stepsizes for convex composite optimization

L Guo, X Shi, J Cao, Z Wang - IEEE Transactions on Signal …, 2023 - ieeexplore.ieee.org
This paper proposes a novel CTA (Combine-Then-Adapt)-based decentralized algorithm for
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

Y Wang, S Liu, B Sun, X Li - IEEE Transactions on Industrial …, 2022 - ieeexplore.ieee.org
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 …

Event-triggered primal–dual design with linear convergence for distributed nonstrongly convex optimization

X Yu, Y Fan, S Cheng - Journal of the Franklin Institute, 2023 - Elsevier
This paper designs continuous-time algorithms with linear convergence for solving
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 …

Neurodynamic approaches for multi-agent distributed optimization

L Guo, I Korovin, S Gorbachev, X Shi, N Gorbacheva… - Neural Networks, 2024 - Elsevier
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 …

Asynchronous Distributed Optimization with Delay-free Parameters

X Wu, C Liu, S Magnusson, M Johansson - arxiv preprint arxiv …, 2023 - arxiv.org
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 …

Decentralized Douglas-Rachford splitting methods for smooth optimization over compact submanifolds

K Deng, J Hu, H Wang - arxiv preprint arxiv:2311.16399, 2023 - arxiv.org
We study decentralized smooth optimization problems over compact submanifolds.
Recasting it as a composite optimization problem, we propose a decentralized Douglas …

Distributed sparsity constrained optimization over the Stiefel manifold

W Qu, H Chen, X **u, W Liu - Neurocomputing, 2024 - Elsevier
Distributed optimization aims to effectively complete specified tasks through cooperation
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 …

Distributed stochastic proximal algorithm with random reshuffling for nonsmooth finite-sum optimization

X Jiang, X Zeng, J Sun, J Chen… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
The nonsmooth finite-sum minimization is a fundamental problem in machine learning. This
article develops a distributed stochastic proximal-gradient algorithm with random reshuffling …