Optimal control in nonlinear models: a generalised Gauss-Newton algorithm with analytic derivatives
In this paper we propose an algorithm for the solution of optimal control problems with nonlinear models based on a generalised Gauss- Newton algorithm but making use of analytic model derivatives. The method is implemented in WinSolve, a general nonlinear model solu- tion program.
|Date of creation:||Mar 2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (01483) 259380
Fax: (01483) 259548
Web page: http://www.surrey.ac.uk/economics/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Juillard, Michel & Laxton, Douglas & McAdam, Peter & Pioro, Hope, 1998. "An algorithm competition: First-order iterations versus Newton-based techniques," Journal of Economic Dynamics and Control, Elsevier, vol. 22(8-9), pages 1291-1318, August.
- Armstrong, John & Black, Richard & Laxton, Douglas & Rose, David, 1998. "A robust method for simulating forward-looking models," Journal of Economic Dynamics and Control, Elsevier, vol. 22(4), pages 489-501, April.
- Juillard, Michel, 1996. "Dynare : a program for the resolution and simulation of dynamic models with forward variables through the use of a relaxation algorithm," CEPREMAP Working Papers (Couverture Orange) 9602, CEPREMAP.
- Boucekkine, Raouf, 1995. "An alternative methodology for solving nonlinear forward-looking models," Journal of Economic Dynamics and Control, Elsevier, vol. 19(4), pages 711-734, May.
When requesting a correction, please mention this item's handle: RePEc:sur:surrec:0906. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alex Mandilaras)
If references are entirely missing, you can add them using this form.