1973
DOI: 10.1080/00207727308919993
|View full text |Cite
|
Sign up to set email alerts
|

Optimum system modelling using recent gradient methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

1973
1973
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…As is well known, considerable improvement in the rate of convergence is obtained in deterministic problems if more efficient gradient search techniques are used. As shown in a recent paper [13], the new Fletcher method is probably the most efficient. Hence, a stochastic approximation algorithm based on such a method will converge to the optimum much faster than the Kiefer-Wolfowitz algorithm.…”
Section: P(p) Y(t)mentioning
confidence: 94%
“…As is well known, considerable improvement in the rate of convergence is obtained in deterministic problems if more efficient gradient search techniques are used. As shown in a recent paper [13], the new Fletcher method is probably the most efficient. Hence, a stochastic approximation algorithm based on such a method will converge to the optimum much faster than the Kiefer-Wolfowitz algorithm.…”
Section: P(p) Y(t)mentioning
confidence: 94%
“…The second proposed methods group of reduced order model is based on the optimization without regarding to important eigen-values of the original model [3] - [4].…”
Section: Introductionmentioning
confidence: 99%