The learning problem for extremal search ``in the mean''. (Q1432199)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The learning problem for extremal search ``in the mean. |
scientific article; zbMATH DE number 2074515
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The learning problem for extremal search ``in the mean''. |
scientific article; zbMATH DE number 2074515 |
Statements
The learning problem for extremal search ``in the mean''. (English)
0 references
15 June 2004
0 references
The author seeks the minimum of function \(F\) on a Riemannian \(n\)-dimensional manifold. The quadratic approximation of the problem can be reduced to an eigenvalue problem. For the generalized case, the learning process is described by nonlinear equation, which is a basic model for the analysis of autosoliton solutions.
0 references
