Automatic differentiation and spectral projected gradient methods for optimal control problems

Optimization Methods and Software

Volumn 10, Issue 2, 1998, Pages 125-146

  Birgin, Ernesto G ^a   Evtushenko, Yuri G ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b DORODNICYN COMPUTING CENTER   (Russian Federation)

Author keywords

Automatic differentiation; Nonmonotone line search; Optimal control problem; Runge Kutta integration methods; Software for optimal control problems; Spectral projected gradient

Indexed keywords

EID: 0000222244     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805707     Document Type: Article

References (37)

1. B.M. Averick, J.J. Moré, C.H. Bischof, A. Carle and A. Griewank, Computing large sparse Jacobian matrices using automatic differentiation, SIAM Journal in Scientific Computing 15 (1994), 285-294.
2. M.C. Bartholomew-Biggs, L. Bartholomew-Biggs and B. Christianson, Optimization & automatic differentiation in ADA: some practical experience, Optimization Methods and Software 4 (1994), 47-73.
3. J. Barzilai and J.M. Borwein, Two point step size gradient methods, IMA Journal of Numerical Analysis 9 (1988), 141-148.
4. D. Bertsekas, On the Goldstein-Levitin-Polyak gradient projection method, IEEE Transactions on Automatic Control, 21 (1976), 174-184.
5. E.G. Birgin, J.M. Martinez and M. Raydan, Nonmonotone spectral projected gradient methods on convex sets, RP 92/97 (Applied Mathematics Department, IMECC-UNICAMP, Brazil, 1997).
6. E.G. Birgin, Automatic differentiation and applications, PhD Thesis (Applied Mathematics Department, IMECC-UNICAMP, Brazil, 1998) (in Portuguese).
7. C.H. Bischof and A. Griewank, ADIFOR: A Fortran system for portable automatic differentiation, Preprint MCS-P317-0792 (Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, 1992).
8. J.C. Butcher, On Runge-Kutta processes of high order, Journal of Australian Mathematic Society, 4 (1964), 179-194.
9. A.R. Conn, N.I.M. Gould and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis 25 (1988), 433-460. See also SIAM Journal on Numerical Analysis 26 (1989), 764-767.
10. A.R. Conn, N.I.M. Gould and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis 25 (1988), 433-460. See also SIAM Journal on Numerical Analysis 26 (1989), 764-767.
11. M.A. Diniz-Ehrhardt, M.A. Gomes-Ruggiero and S.A. Santos, Comparing the numerical performance of two trust-region algorithms for large-scale bound-constrained minimization, International Workshop of Numerical Linear Algebra and Optimization (R.J.B. Sampaio and J.Y. Yuan, Department of Mathematics, Federal University of Paraná, Brazil, 1997), 23-24. (To appear in Investigación Operativa.)
12. M.A. Diniz-Ehrhardt, M.A. Gomes-Ruggiero and S.A. Santos, Comparing the numerical performance of two trust-region algorithms for large-scale bound-constrained minimization, International Workshop of Numerical Linear Algebra and Optimization (R.J.B. Sampaio and J.Y. Yuan, Department of Mathematics, Federal University of Paraná, Brazil, 1997), 23-24. (To appear in Investigación Operativa.)
13. Y.G. Evtushenko, Numerical Optimization Techniques (Optimization Software Inc., Publications Division, New York, 1985).
14. Y.G. Evtushenko, Automatic differentiation viewed from optimal control theory, Automatic Differentiation of Algorithms. Theory, Implementation and Application (A. Griewank and G.F. Corliss, SIAM, Philadelphia, 1997), pp. 25-30.
15. Y.G. Evtushenko, Computation of exact gradients in distributed dynamic systems, Optimization Methods and Software 9 (1998), 45-75.
16. E. Fehlberg, New high-order Runge-Kutta formulas with stepsize control for systems of first and second-order differential equations, Z. Angew. Math. Mech. 44 (1964), T17-T29.
17. E. Fehlberg, New high-order Runge-Kutta formulas with an arbitrary small truncation error, Z. Angew. Math. Mech. 46 (1964), 1-16.
18. E. Fehlberg, Klassische Runge-Kutta formeln fünfter und siebenter ordnung mit schrittweiten-kontrolle, Computing 4 (1964), 93-106.
19. A. Friedlander, J.M. Martinez and S.A. Santos, A new trust region algorithm for bound constrained minimization, Applied Mathematics and Optimization 30 (1994), 235-266.
20. A.A. Goldstein, Convex programming in Hilbert space, Bulletin of the American Mathematical Society 70 ( 1964), 709-710.
21. N.I. Grachev and Y.G. Evtushenko, A library of programs for solving optimal control problems, USSR Computational Mathematics and Mathematical Physics 19 (1980), 99-119.
22. N.I. Grachev and A.N. Filkov, Solution of optimal control problems in system DISO (Computing Center of Russian Academy of Sciences, Moscow, 1986) (in Russian).
23. A. Griewank, On automatic differentiation, Mathematical Programming: Recent Developments and Applications (M. Iri and K. Tanabe, Kluwer Academic Publishers, 1989), pp. 83-108.
24. A. Griewank and G.F. Corliss, Automatic Differentiation of Algorithms. Theory, Implementation and Application (A. Griewank and G.F. Corliss, SIAM, Philadelphia, 1991).
25. A. Griewank, ADOL-C. A package for the automatic differentiation of algorithms written in C/C++, ACM TOMS 22 (1996), 131-167.
26. L. Grippo, F. Lampariello and S. Lucidi, A nonmonotone line search technique for Newton's method, SIAM Journal on Numerical Analysis 23 (1986), 707-716.
27. M. Iri, Simultaneous computation of functions, partial derivatives and estimates of rounding errors - Complexity and practicality, Japan Journal of Applied Mathematics 1 (1984), 223-252.
28. M. Iri and K. Kubota, Methods of fast automatic differentiation and applications, Research memorandum RMI (Department of Mathematical Engineering and Instrumental Physics, Faculty of Engineering, University of Tokyo, 1987), pp. 87-102.
29. M. Iri History of automatic differentiation and rounding error estimation, Automatic Differentiation of Algorithms. Theory, Implementation and Application (A. Griewank and G.F. Corliss, SIAM, Philadelphia, 1991), pp. 3-16.
30. E.S. Levitin and B.T. Polyak, Constrained minimization problems, USSR Computational Mathematics and Mathematical Physics 6 (1966), 1-50.
31. E. Polak, Computation Methods in Optimization (Academic Press, New York and London, 1971).
32. M. Raydan, On the Barzilai and Borwein choice of steplength for the gradient method, IMA Journal of Numerical Analysis 13 (1993), 321-326.
33. M. Raydan, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM Journal on Optimization 7 (1997), 26-33.
34. J. Stoer and R. Bulirsch, Introduction to Numerical Analysis (Springer-Verlag Inc., Berlin, Heidelberg and New York, 1972).
35. K.L. Teo and Z.S. Wu, Computation Methods for Optimizing Distributed Systems (Academic Press, Orlando, 1984).
36. K.L. Teo, C.J. Goh and K.H. Wong, A Unified Computation Approach to Optimal Control Problems (Longman Scientific & Technical, England, 1991).
37. E.B. Shanks, Solution of differential equations by evaluation of functions, Mathematical Computation 20 (1966), 21-38.