1997 European Control Conference (ECC) 1997
DOI: 10.23919/ecc.1997.7082085
|View full text |Cite
|
Sign up to set email alerts
|

Synthetic generation of the gradient for an iterative controller optimization method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2002
2002
2007
2007

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 3 publications
0
9
0
Order By: Relevance
“…This result shows that even if the operators C À1 C 0 and T 0 do not commute, the descent method (14) might still be locally convergent using this approximation method.…”
Section: Theoremmentioning
confidence: 87%
See 3 more Smart Citations
“…This result shows that even if the operators C À1 C 0 and T 0 do not commute, the descent method (14) might still be locally convergent using this approximation method.…”
Section: Theoremmentioning
confidence: 87%
“…[14] for linear systems and [7] for non-linear systems. In [15] it is remarked that in practice IFT seems to be robust w.r.t.…”
Section: Gradient Approximationsmentioning
confidence: 99%
See 2 more Smart Citations
“…In [4] this problem is solved by filtering the output signal back through the actual closed-loop system, demanding three experiments for the computation of each tuning direction. Another approach consists of performing an open-loop, identification of a high order parametric model for T ( p ) , reducing the number of experiments to just one [2]. Given that T ( p ) is required only for filtering a virtual signal, a non-parametric representation of this filter suffices to reach the final result.…”
Section: Derivatives Of the Cost Functionmentioning
confidence: 99%