W. Roemisch and M. Baguer. Computing gradients in parametrization- discretization schemes for constrained optimal control problems, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On multi-directional search in Optimization - Gomez, Gomez (1995) (Correct)
.... : Forget the dependence of h on u; and after the calculation of the complete discrete solution x i ; when we already know the used steps h i ; calculate the gradient rJ hk (u) of the function J hk (u) x N ] where xN is given by (88) to (91) Formulas for this gradient are well known (see [13] or [9] but is precisely here where the global convergence of any optimization algorithm, applied for the solution of the subproblem (84) can t be ensured. At each step k and each time when we calculate approximated values and gradients of J; we change the discrete model (because different steps ....
.- Roemish, W.; M.L. Baguer, Computing gradients in parametrization- discretization schemes for constrained optimal control problems. Technical report No. 508, Humboldt University-Berlin, 1994.
Information-Theoretic Control of Multiple Sensor Platforms - Grocholsky (2002) (1 citation) (Correct)
No context found.
W. Roemisch and M. Baguer. Computing gradients in parametrization- discretization schemes for constrained optimal control problems, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC