.png){kind=icon}
.png){kind=icon}
Return
Distributed Newton seeking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2020.107206.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This manuscript proposes a distributed Newton seeking for the solution of distributed optimization problems with locally measured but unknown cost functions. The approach implements a Newton step for both the primal and dual problems that can be implemented in a completely decentralized fashion. Unlike existing techniques, no exchange of derivative information between agents is required. In addition, no explicit inversion of the Hessian information is required to generate the required Newton step. The local gradients and Hessians are estimated using a perturbation based extremum seeking control technique. A simulation study demonstrates the effectiveness of the technique. (C) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Newton consensus
Extremum seeking
Distributed optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W