A Steepest-Ascent Method for Solving Optimum Programming Problems
By A. Bryson, W. Denham. 1962
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Barak A. Pearlmutter
- J. Urgen Schmidhuber
- Yoshua Bengio
- James Martens
- Sergey Levine
- Percy Liang
- Ruslan Salakhutdinov
- Quoc V. Le
Citations in the corpus
- Learning State Space Trajectories in Recurrent Neural Networks (1989, background): “m , - 7 , h « i * < One can also derive (8), (9) and (10) using the calculus of variations and Lagrange multipliers (William Skaggs, personal communication), or from the continuous form of dynamic programming [5].”
- Gradient calculations for dynamic recurrent neural networks: a survey (1995, methodology): “One is direct, using the calculus of variations [98].”