.png){kind=icon}
.png){kind=icon}
Return
Discrete-Time Algorithm for Distributed Unconstrained Optimization Problem With Finite-Time Computations
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2020.2987947.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Distributed unconstrained optimization
discrete-time algorithm
conjugate gradient method
finite-time computations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W