On the implementation of an algorithm for large-scale equality constrained optimization

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 682-706

  Lalee, Marucha ^a   Nocedal, Jorge ^a   Plantenga, Todd ^b  

^a Northwestern University   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Constrained optimization; Large scale optimization; Minimization; Nonlinear optimization; Quasi Newton methods; Trust region methods

Indexed keywords

EID: 0032327604     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623493262993     Document Type: Article

References (46)

1. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
2. R. H. BYRD, Robust trust region methods for constrained optimization, Third SIAM Conference on Optimization, Houston, TX, May 1987.
3. R. H. BYRD, J. CH. GILBERT, AND J. NOCEDAL, A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming, Tech. report OTC 96/02, Optimization Technology Center, Northwestern University, Evanston, IL, 1996.
4. R. H. BYRD, J. NOCEDAL, AND R. B. SCHNABEL, Representations of quasi-Newton matrices and their use in limited memory methods, Math. Programming, Ser. A, 63 (1994), pp. 129-156.
5. R. H. BYRD, R. B. SCHNABEL, AND G. A. SCHULTZ, A trust region algorithm for nonlinearly constrained optimization, SIAM J. Numer. Anal., 24 (1987), pp. 1152-1170.
6. R. G. CARTER, On the global convergence of trust region algorithms using inexact gradient information, SIAM J. Numer. Anal., 28 (1991), pp. 251-265.
7. M. R. CELIS, J. E. DENNIS, AND R. A. TAPIA, A trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, Philadelphia, 1985, pp. 71-82.
8. T. F. COLEMAN AND A. R. CONN, Nonlinear programming via an exact penalty function: Global analysis, Math. Programming, 24 (1982), pp. 137-161.
9. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Ser. Comput. Math., Springer-Verlag, Berlin, 1992.
10. E. J. CRAIG, The N-step iteration procedure, J. Math. Phys., 34 (1955), pp. 65-73.
11. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
12. J. E. DENNIS, M. EL-ALEM, AND M. C. MACIEL, A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization, Tech. report 92-28, Dept. of Mathematical Sciences, Rice University, Houston, TX, 1992.
13. J. E. DENNIS JR. AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
14. I. S. DUFF AND J. K. REID, A comparison of some methods for the solution of sparse overdetermined systems of linear equations, J. Inst. Maths. Applics., 17 (1976), pp. 267-280.
15. I. S. DUFF AND J. K. REID, Some design features of a sparse matrix code, ACM Trans. Math. Software, 5 (1979), pp. 18-35.
16. M. M. EL-ALEM, A global convergence theory for the Celis-Dennis-Tapia trust region algorithm for constrained optimization, SIAM J. Numer. Anal., 28 (1991), pp. 266-290.
17. M. M. EL-ALEM, A Robust Trust-Region Algorithm with a Non-monotonic Penalty Parameter Scheme for Constrained Optimization, Tech. report, Dept. of Mathematical Sciences, Rice University, Houston, TX, 1993.
18. 1 penalty method for nonlinear constraints, in Numerical Optimization 1984, P. T. Boggs, R. H. Byrd, and R. B. Schnabel, eds., SIAM, Philadelphia, 1985, pp. 26-40.
19. R. FLETCHER, Second order corrections for nondifferentiable optimization, in Numerical Analysis, Dundee 1981, G. A. Watson, ed., Lecture Notes in Math. 912, Springer-Verlag, Berlin, 1982.
20. R. FLETCHER, Practical Methods of Optimization, 2nd ed., Wiley & Sons, Chichester, UK, 1990.
21. R. FOURER AND S. MEHROTRA, Solving symmetric indefinite systems in an interior-point method for linear programming, Math. Programming, Ser. B, 62 (1993), pp. 15-39.
22. J. CH. GILBERT AND C. LEMARÉCHAL, Some numerical experiments with variable-storage quasi-Newton algorithms, Math. Programming, Ser. B, 45 (1989), pp. 407-435.
23. P. E. GILL, W. MURRAY, AND M. A. SAUNDERS, SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization, Numerical Analysis Report 96-2, Dept. of Mathematics, University of California, San Diego, La Jolla, CA, 1996.
24. S. P. HAN, A globally convergent method for nonlinear programming, J. Optim. Theory Appl., 22 (1977), pp. 297-309.
25. M. HEINKENSCHLOSS, On the solution of a two-ball trust region subproblem, Math. Programming, Ser. A, 64 (1994), pp. 249-276.
26. M. E. HRIBAR, Large-Scale Constrained Optimization, Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, Northwestern University, Chicago, IL, 1996.
27. D. C. LIU AND J. NOCEDAL, On the limited memory BFGS method for large scale optimization, Math. Programming, Ser. B, 45 (1989), pp. 503-528.
28. N. MARATOS, Exact Penalty Function, Algorithms for Finite Dimensional and Control Optimization Problems, Ph.D. thesis, University of London, UK, 1978.
29. B. A. MURTAGH AND M. A. SAUNDERS, Large-scale linearly constrained optimization, Math. Programming, 14 (1978), pp. 41-72.
30. E. G. NG AND B. W. PEYTON, Block sparse Cholesky algorithms on advanced uniprocessor computers, SIAM J. Sci. Statist. Comp., 14 (1993), pp. 1034-1056.
31. J. NOCEDAL AND T. D. PLANTENGA, Solving KKT systems using limited memory BFGS matrices, manuscript.
32. E. O. OMOJOKUN, Trust Region Algorithms for Optimization with Nonlinear Equality and Inequality Constraints, Ph.D. thesis, Dept. of Computer Science, University of Colorado, Boulder, 1989.
33. T. D. PLANTENGA, Large-Scale Nonlinear Constrained Optimization Using Trust Regions, Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, Northwestern University, Chicago, IL, 1994.
34. T. D. PLANTENGA, A trust region method for nonlinear programming based on primal interior-point techniques, SIAM J. Sci. Comput., to appear.
35. M. J. D. POWELL, A hybrid method for nonlinear equations, in Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz, ed., Gordon and Breach, London, UK, 1970, pp. 87-114.
36. M. J. D. POWELL, The convergence of variable metric methods for nonlinearly constrained optimization calculations, in Nonlinear Programming 3, O. Mangasarian, R. Meyer, and S. Robinson, eds., Academic Press, New York, London, 1978, pp. 27-63.
37. M. J. D. POWELL AND Y. YUAN, A recursive quadratic programming algorithm that uses differentiable exact penalty functions, Math. Programming, 35 (1986), pp. 265-278.
38. M. J. D. POWELL AND Y. YUAN, A trust region algorithm for equality constrained optimization, Math. Programming, Ser. A, 49 (1991), pp. 189-211.
39. G. A. SCHULTZ, R. B. SCHNABEL, AND R. H. BYRD, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Numer. Anal., 22 (1985), pp. 47-67.
40. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
41. PH. L. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, New York, 1981, pp. 57-87.
42. A. VARDI, A trust region algorithm for equality constrained minimization: Convergence properties and implementation, SIAM J. Numer. Anal., 22 (1985), pp. 575-591.
43. K. A. WILLIAMSON, A Robust Trust Region Algorithm for Nonlinear Programming, Ph.D. thesis, Dept. of Mathematical Sciences, Rice University, Houston, TX, 1991.
44. Y. YUAN, On a subproblem of trust region algorithms for constrained optimization, Math. Programming, Ser. A, 47 (1990), pp. 53-63.
45. J. Z. ZHANG AND D. T. ZHU, Projected quasi-Newton algorithm with trust region for constrained optimization, J. Optim. Theory Appl., 67 (1990), pp. 369-393.
46. Y. ZHANG, Computing a Celis-Dennis-Tapia trust region step for equality constrained optimization, Math. Programming, Ser. A, 55 (1992), pp. 109-124.