Inverse optimal extremum seeking under delays (Q6174055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7712455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse optimal extremum seeking under delays |
scientific article; zbMATH DE number 7712455 |
Statements
Inverse optimal extremum seeking under delays (English)
0 references
13 July 2023
0 references
In this paper, the authors investigate on inverse optimal extremum seeking under delays. More concretely, they establish the inverse optimality in the average sense of an earlier Gradient- and Newton-based extremum seeking algorithms for maximizing unknown locally quadratic maps in the presence of constant delays.
0 references
extremum seeking
0 references
time delays
0 references
inverse optimality
0 references
predictors
0 references
backstepping transformation
0 references
0 references
0 references
0 references
0 references
0.92511815
0 references
0.89674544
0 references
0.8964999
0 references
0 references
0.8808159
0 references
0 references
0.8728354
0 references
0.8688882
0 references
0.86248296
0 references
