Testing a class of methods for solving minimization problems with simple bounds on the variables

Mathematics of Computation

Volumn 50, Issue 182, 1988, Pages 399-430

  Conn, Andrew R ^a   Gould, Nicholas I M ^b   Toint, Philippe L ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CULHAM SCIENCE CENTRE   (United Kingdom)

^c UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966215545     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1988-0929544-3     Document Type: Article

References (29)

1. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, London and New York, 1982.
2. R. K. BRAYTON & J. CULLUM, “An algorithm for minimizing a differentiable function subject to box constraints and errors, ” J. Optim. Theory Appl., v. 29, 1979, pp. 521-558.
3. A. R. CONN, N. I. M. Gould & PH. L. TOINT, “Global convergence of a class of trust region algorithms for optimization with simple bounds, ” SIAM J. Numer. Anal., v. 25, 1988, pp. 433-460
4. E. E. CRAGG & A. V. LEVY, “Study on a supermemory gradient method for the minimization of functions, ” J. Optim. Theory Appl., v. 4, 1969, pp. 191-205.
5. J. CULLUM & R. K. BRAYTON, “Some remarks on the symmetric rank-one update, ” J. Optim. Theory Appl., v. 29, 1979, pp. 493-520.
6. R. S. DEMBO, S. C. EISENSTAT & T. STEIHAUG, “Inexact Newton methods, ” SIAM J. Numer. Anal., v. 19, 1982, pp. 400-408
7. R. S. DEMBO & U. TULOWITZKI, On the Minimization of Quadratic Functions Subject to Box Constraints, Working paper series B 71, School of Organization and Management, Yale University, 1983.
8. J. E. DENNIS & R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Ciffs, N.J., 1983.
9. R. FLETCHER, Practical Methods of Optimization, Vol. 1, Wiley, Chichester and New York, 1980.
10. R. FLETCHER & M. P. JACKSON, “Minimization of a quadratic function of many variables subject only to lower and upper bounds, ” J. Inst. Math. Appl., v. 14, 1974, pp. 159-174.
11. U. M. GARCIAPALOMARES, “Superlinearly convergent algorithms for linearly constrained optimization, ” in Nonlinear Programming 2 (O. L. Mangasarian, R. R. Meyer and S. M. Robinson, eds.), Academic Press, London and New York, 1975, pp. 101-119.
12. P. E. GILL & W. MURRAY, Minimization Subject to Bounds on the Variables, report NAC 71, National Physical Laboratory, England, 1976.
13. P. E. Gill, W. Murray, M. A. Saunders & M. H. WRIGHT, Some Theoretical Properties of an Augmented Lagrangian Function, Technical Report SOL 86-6, Department of Operations Research, Stanford University, 1986.
14. P. E. GILL, W. Murray & M. H. WRIGHT, Practical Optimization, Academic Press, London and New York, 1981.
15. A. GRIEWANK & PH. L. TOINT, “On the unconstrained optimization of partially separable functions, ” in Nonlinear Optimization, 1981 (M. J. D. Powell, ed.), Academic Press, London and New York, 1982, pp. 301-312.
16. A. GRIEWANK & Ph. L. TOINT, “Partitioned variable metric updates for large structured optimization problems, ” Numer. Math., v. 39, 1982, pp. 119-137
17. W. HOCK & K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems 187, Springer-Verlag, Berlin, 1981.
18. J. J. MORE, “Recent developments in algorithms and software for trust region methods, ” Mathematical Programming, The State of the Art, Bonn 1982 (A. Bachem, M. Grotschel and B. Korte, eds.), Springer-Verlag, Berlin, 1983, pp. 258-287
19. J. J. MORE, B. S. GARBOW & K. E. HILLSTROM, “Testing unconstrained optimization software, ” ACM Trans. Math. Software, v. 7, 1981, pp. 17-41.
20. J. L. NAZARETH, “Analogues of Dixon’s and Powell’s theorems for unconstrained minimization with inexact line searches, ” SIAM J. Numer. Anal., v. 23, 1986, pp. 170-177
21. D. P. OLEARY, “A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, ” Linear Algebra Appl., v. 34, 1980, pp. 371-399.
22. M. J. D. POWELL, “A new algorithm for unconstrained optimization, ” in Nonlinear Programming (J. B. Rosen, O. L. Mangasarian and K. Ritter, eds.), Academic Press, London and New York, 1970, pp. 31-65.
23. M. J. D. POWELL, Some Global Convergence Properties of a Variable Metric Algorithm for Minimization Without Exact Line Searches, SIAM-AMS Proc., vol. 9, Amer. Math. Soc., Providence, R.I., 1976, pp. 53-72.
24. M. J. D. POWELL, “How bad are the BFGS and DFP methods when the objective function is quadratic?, ” Math. Programming, v. 34, 1986, pp. 34-47.
25. D. F. SHANNO & K. H. PHUA, “Matrix conditioning and nonlinear optimization, ” Math. Programming, v. 14, 1978, pp. 145 160.
26. D. C. SORENSEN, “An example concerning quasi-Newton estimation of a sparse Hessian, ” SIGNUM Newsletter, v. 16, 1981, pp. 8-10.
27. T. STEIHAUG, “The conjugate gradient method and trust regions in large scale optimization, ” SIAM J. Numer. Anal., v. 20, 1983, pp. 626-637.
28. PH. L. TOINT, “Some numerical results using a sparse matrix updating formula in unconstrained optimization, ” Math. Comp., v. 32, 1978, pp. 839-851.
29. PH. L. TOINT, “Towards an efficient sparsity exploiting Newton method for minimization, ” in Sparse Matrices and Their Uses (I. S. Duff, ed.), Academic Press, London and New York, 1981.