Steepest Descent Algorithm
Mostrando 1-7 de 7 artigos, teses e dissertações.
-
1. A Review of Gradient Algorithms for Numerical Computation of Optimal Trajectories
Abstract: In this paper, two classic direct methods for numerical computation of optimal trajectories were revisited: the steepest descent method and the direct one based upon the second variation theory. The steepest descent method was developed for a Mayer problem of optimal control, with free final state and fixed terminal times. Terminal constraints on t
J. Aerosp. Technol. Manag.. Publicado em: 2012-06
-
2. Estudo de alguns metodos determinsticos de otimização irrestrita / Study of some deterministic methods for unconstrained optimization
In this work some classical methods of linear search for unconstrained optimization are studied. The main mathematical formulations for the optimization problem are presented. Two strategies, linear search and trust region, for the algorithm to move from one iteration to another are discussed. Furthermore, the main considerations about the choice of step len
Publicado em: 2010
-
3. Comparação de métodos de otimização para o problema de ajuste de histórico em ambientes paralelos
The process of history matching aims on the determination of the models parameters from a petroleum reservoir. Once adjusted, the models can be used for the prediction of the reservoir behavior. This work presents a comparsion of dierent optimization methods for this problem s solution. Derivative based methods are compared to a genetic algorithm. In particu
Publicado em: 2009
-
4. Projeto de controladores baseado em dados : convergência dos métodos iterativos
O projeto de controladores baseado em dados consiste no ajuste dos parâmetros do controlador diretamente das bateladas de dados do processo, sem a necessidade de um modelo. O ajuste é feito resolvendo um problema de otimização, onde procura-se o argumento que minimize uma determinada função custo. Para resolver o problema de otimização são utilizado
Publicado em: 2009
-
5. Numerical computation of optimal low-thrust limited-power trajectories - Transfers between coplanar circular orbits
An algorithm based on gradient techniques, proposed in a companion paper, is applied to numerical analysis of optimal low-thrust limited-power trajectories for simple transfer (no rendezvous) between coplanar circular orbits in a central Newtonian gravity field. The proposed algorithm combines the main positive characteristics of two well-known methods in op
Journal of the Brazilian Society of Mechanical Sciences and Engineering. Publicado em: 2005-06
-
6. An extension of the steepest descent method for Riemann-Hilbert problems: The small dispersion limit of the Korteweg-de Vries (KdV) equation
This paper extends the steepest descent method for Riemann-Hilbert problems introduced by Deift and Zhou in a critical new way. We present, in particular, an algorithm, to obtain the support of the Riemann-Hilbert problem for leading asymptotics. Applying this extended method to small dispersion KdV (Korteweg-de Vries) equation, we (i) recover the varia
The National Academy of Sciences.
-
7. An analysis of neural receptive field plasticity by point process adaptive filtering
Neural receptive fields are plastic: with experience, neurons in many brain regions change their spiking responses to relevant stimuli. Analysis of receptive field plasticity from experimental measurements is crucial for understanding how neural systems adapt their representations of relevant biological information. Current analysis methods using histogram e
The National Academy of Sciences.