Family of projected descent methods for optimization problems with simple bounds

Journal of Optimization Theory and Applications

Volumn 92, Issue 1, 1997, Pages 1-31

  Schwartz, A ^a   Polak, E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Conjugate gradient methods; Limited memory BFGS methods; Optimization; Projections; Simple bounds

Indexed keywords

NEWTON-RAPHSON METHOD; OPTIMIZATION;

BFGS METHOD; CONJUGATE-GRADIENT METHOD; DESCENT DIRECTIONS; LIMITED MEMORY; LIMITED-MEMORY BFGS METHOD; LOCAL MINIMIZER; OPTIMISATIONS; PROJECTION; SIMPLE BOUND; SIMPLE++;

CONJUGATE GRADIENT METHOD;

EID: 0031542781     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022690711754     Document Type: Article

References (27)

1. GOLDSTEIN, A. A., Convex Programming in Hilbert Space, Bulletin of the American Mathematical Society, Vol. 70, pp. 709-710, 1964.
2. LEVITIN, E. S., and POLYAK, B. T., Constrained Minimization Problems, USSR Computational Mathematics and Mathematical Physics, Vol. 6, pp. 1-50, 1966.
3. BERTSEKAS, D. P., On the Goldstein-Levitin-Poljak Gradient Projection Method, IEEE Transactions on Automatic Control, Vol. 21, pp. 174-184, 1976.
4. BERTSEKAS, D. P., Projected Newton Methods for Optimization Problems with Simple Constraints, SIAM Journal on Control and Optimization, Vol. 20, pp. 221-246, 1982.
5. DUNN, J. C., A Projected Newton Method for Minimization Problems with Nonlinear Inequality Constraints, Numerische Mathematik, Vol. 53, pp. 377-409, 1988.
6. QUINTANA, V. H., and DAVISON, E. J., Clipping-off Gradient Algorithms to Compute Optimal Controls with Constrained Magnitude, International Journal of Control, Vol. 20, pp. 243-255, 1974.
7. CONN, A. R., GOULD, N., and TOINT, P. L., Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds, SIAM Journal on Numerical Analysis, Vol. 25, pp. 433-460, 1988.
8. CONN, A. R., GOULD, N., and TOINT, P. L., A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds, SIAM Journal on Numerical Analysis, Vol. 28, pp. 545-572, 1991.
9. BYRD, R. H., LU, P., NOCEDAL, J., and ZHU, C., A Limited Memory Algorithm for Bound Constrained Optimization, Report NAM-08, Electrical Engineering Department, Northwestern University, 1994.
10. MORE, J. J., and TORALDO, G., Algorithms for Bound Constrained Quadratic Programming Problems, Numerische Mathematik, Vol. 55, pp. 377-400, 1989.
11. CALAMAI, P. H., and MORE, J. J., Projected Gradient Methods for Linearly Constrained Problems, Mathematical Programming, Vol. 39, pp. 93-116, 1987.
12. KELLEY, C. T., and SACHS, E. W., Solution of Optimal Control Problems by a Pointwise Projected Newton Method, SIAM Journal on Control and Optimization, Vol. 33, pp. 1731-1757, 1995.
13. POLAK, E., SARGENT, R. W. H., and SEBASTIAN, D. J., On the Convergence of Sequential Minimization Algorithms, Journal of Optimization Theory and Applications, Vol. 14, pp. 439-442, 1974.
14. NOCEDAL, J., Updating Quasi-Newton Matrices with Limited Storage, Mathematics of Computation, Vol. 35, pp. 773-782, 1980.
15. POWELL, M. J. D., Restart Procedures for the Conjugate Gradient Method, Mathematical Programming, Vol. 12, pp. 241-254, 1977.
16. LUENBERGER, D. G., Linear and Nonlinear Programming, 2nd Edition, Addison-Wesley Publishing Company, Reading, Massachusetts, 1984.
17. BERTSEKAS, D. P., Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, New York, 1982.
18. GOLUB, G. H., and LOAN, C. F., Matrix Computations, 2nd Edition, Johns Hopkins University Press, Baltimore, Maryland, 1989.
19. LUENBERGER, D. G., Convergence Rate of a Penalty-Function Scheme, Journal of Optimization Theory and Applications, Vol. 7, pp. 39-51, 1971.
20. POLAK, E., Computational Methods in Optimization, Academic Press, New York, New York, 1971.
21. GILBERT, J. C., and NOCEDAL, J., Global Convergence Properties of Conjugate Gradient Methods for Optimization, SIAM Journal on Optimization, Vol. 2, pp. 21-42, 1992.
22. SCHWARTZ, A., and POLAK, E., Consistent Approximations for Optimal Control Problems Based on Runge-Kutta Integration, SIAM Journal on Optimization and Control, Vol. 34, pp. 1235-1269, 1996.
23. BERTSEKAS, D. P., Partial Conjugate Gradient Methods for a Class of Optimal Control Problems, IEEE Transactions on Automatic Control, Vol. 19, pp. 209-217, 1974.
24. DUNN, J. C., and BERTSEKAS, D. P., Efficient Dynamic Programming Implementations of Newton's Method for Unconstrained Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 63, pp. 23-38, 1989.
25. LIU, D. C., and NOCEDAL, J., On the Limited Memory BFGS Method for Large-Scale Optimization, Mathematical Programming, Vol. 45, pp. 503-528, 1989.
26. SHANNO, D. F., and PHUA, K. H., Matrix Conditioning and Nonlinear Optimization, Mathematical Programming, Vol. 14, pp. 149-160, 1978.
27. ZOU, X., NAVON, I. M., BERGER, M., PHUA, K. H., SCHLICK, T., and DIMET, F. X., Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods, SIAM Journal on Optimization, Vol. 3, pp. 582-608, 1993.