NobleBlocks

Research indexJournal article

Discrete-Time Algorithm for Distributed Unconstrained Optimization Problem With Finite-Time Computations

Liu, Yu

IEEE Transactions on Circuits & Systems II Express Briefs14 Apr 2020

NobleIDark:/48914/w1/20260526/C61F11BCDOI10.1109/tcsii.2020.2987947

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

This brief investigates the distributed unconstrained optimization problem, where its global objective function consists of the sum of $N$ local objective functions. The aim for this brief is to design a discrete-time algorithm to solve the considered distributed optimization problem using only local computations and local information exchanges. To this end, a discrete-time algorithm resorting to the conjugate gradient method is proposed, and by it, the optimal solution to a class of distributed optimization problems over a static undirected graph can be obtained with finite-time computations under some mild conditions. Furthermore, simulations are given to verify the validity of the designed algorithm.

Discussion

Citations

Topics

More

Suggest a correction or report