Advances in trust region algorithms for constrained optimization

Applied Numerical Mathematics

Volumn 29, Issue 3, 1999, Pages 423-443

  Sadjadi, Seyed Jafar ^a   Ponnambalam, K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Constrained optimization; Extended Lagrangian function; Least square techniques; Penalty function; Trust region; Water resources

Indexed keywords

EID: 0040437555     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00105-6     Document Type: Article

References (41)

1. C.G. Broyden, A class of methods for solving nonlinear simultaneous equations, Math. Comp. 19 (1965) 577-593.
2. J.E. Celis, M.R. Dennis and R.A. Tapia, A trust region strategy for nonlinear equality constrained optimization, SIAM J. Numer. Anal. (1984).
3. J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
4. J. Duff, I.S. Nocedal and K. Reid, The use of linear programming for the solution of sparse sets of nonlinear equations, SIAM J. Sci. Statist. Comput. 8 (2) (1987) 99-108.
5. M. El-Alem, A global convergence theory for the Celis-Dennis-Tapia trust region algorithm for constrained optimization, Ph.D. Thesis, Department of Computational and Applied Mathematics, Rice University (1988).
6. A.V. Fiacco and G.P. McCormick, Nonlinear Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).
7. R. Fletcher, A modified Marquardt subroutine for nonlinear least squares, Technical Report, Report R6799, Atomic Energy Research Establishment, Harwell, England (1971).
8. R. Fletcher, Harwell Subroutine Library, Technical Report, Harwell (1997).
9. S.G. Fletcher, A new formulation for the stochastic control of systems with bounded state variables: An application to reservoir systems, Ph.D. Thesis, Department of Systems Design Engineering, University of Waterloo (1995).
10. J.A. George and J.W.H. Liu, Algorithm for matrix partitioning and the numerical solution of finite element systems, Technical Report, Department of Applied Math. and Computer Science, University of Waterloo (1976).
11. R.E. Goldfledt, S.M. Quandt and H.F. Trotter, Maximization by quadratic hill climbing, Econometrica 34 (1966) 541-551.
12. M.D. Hebden, An algorithm for minimization using exact second derivatives, Technical Report, Atomic Energy Research Establishment, Harwell, England (1973).
13. M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving linear systems, SIAM J. Sci. Statist. Comput. 49 (1952) 409-436.
14. K. Hock and W. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, Vol. 1 (Springer, New York, 1981).
15. N. Karmarkar, A new polynomial-time algorithm for linear programming, in: Proc. 16th Annual ACM Symposium on the Theory of Computing (1984) 302-311.
16. N. Karmarkar, An interior-point approach to NP-complete problems, in: Proc. 3rd SIAM Conference on Optimization, Boston (1989).
17. K. Levenberg, A method for the solution of certain nonlinear problems in least squares, Quart. Appl. Math. (2) (1944) 164-168.
18. W. Liu and A.H. Sherman, A comparison analysis of the Cuthill-Mckee and reverse Chuthill-Mckee ordering algorithms for sparse matrices, SIAM J. Numer. Anal. 13 (1976) 198-213.
19. B.N. Lundberg and A.B. Poore, Variables order Adams-Bashforth predictors with an error-step-size control for continuation methods, SIAM J. Sci. Statist. Comput. 12 (3) (1991) 695-723.
20. D.W. Marquardt, An algorithm for least squares estimation of nonlinear parameters, in: SIAM Series of Applied Mathematics 11 (SIAM, Philadelphia, PA, 1963) 431-441.
21. J.M. Martínez, An algorithm for solving sparse nonlinear least-square problems, Computing 39 (1987) 307-325.
22. J.M. Martínez and R.F. Santos, An algorithm for solving nonlinear least-square problems with a new curvilinear search, Computing 44 (1990) 83-90.
23. J.J. Moré, The Levenberg-Marquardt algorithm: Implementation and theory, in: G.A. Watson, ed., Proc. of Dundee Conference on Numerical Analysis (Springer, Berlin, 1978).
24. J.J. Moré, Recent developments in algorithm and software for trust region methods, Math. Programming (1983) 258-287.
25. J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Statist. Comput. (1983) 553-572.
26. A.B. Poore and Q. Al-Hassan, The expanded Lagrangian system for constrained optimization problems, SIAM J. Control Optim. 26 (1988) 417-427.
27. M.J.D. Powell, A Hybrid Method for Nonlinear Equations, Numerical Methods for Nonlinear Algebraic Equations (Gordon and Breach, 1970).
28. M.J.D. Powell, A New Algorithm for Unconstrained Optimization, Nonlinear Programming (Academic Press, New York, 1970).
29. F. Rendl and H. Wolkowicz, A semidefinite framework for trust region subproblems with application to large-scale minimization, Technical Report CORR 94-32, Department of Combinatorics and Optimization, University of Waterloo (1994).
30. S.J. Sadjadi. Nonlinear programming using an expanded Lagrangian function: A water resources management case study, Ph.D. Thesis, Department of Systems Design Engineering, University of Waterloo (1997).
31. S.A. Santos and D.C. Sorensen, A new matrix-free algorithm for the large-scale trust-region subproblem, Technical Report TR95-20, Rice University (1995).
32. A.P. Singh, A trust region method for large-scale engineering optimization problems using barrier/potential models, Master's Thesis, Department of System Design Eng., University of Waterloo, Waterloo, Ontario (1993).
33. D.C. Sorensen, Minimization of a large-scale quadratic function subject to an ellipsoidal constraint, Technical Report TR94-27, Department of Computational and Applied Mathematics, Rice University (1994).
34. R.J. Vanderbei and T.J. Carpenter, Symmetric indefinite systems for interior point methods, Math. Programming 58 (1993) 1-32.
35. R.J. Vanderbei and D.F. Shanno, An interior point algorithm for nonconvex nonlinear programming, Technical Report SOR-97-21, Department of Statistics and Operations Research, Princeton University (1997).
36. A. Vardi, A trust region algorithm for equality constrained minimization: Convergence properties and implementation, SIAM J. Numer. Anal. 22 (3) (1985).
37. K.A. Williamson, A robust trust region algorithm for nonlinear programming, Ph.D. Thesis, Department of Computational and Applied Mathematics, Rice University, TR90-22 (1991).
38. M.H. Wright, III-conditioning and computational error in interior methods for nonlinear programming, Technical Report, Computing Sciences Research Center, Bell Laboratories, Murray Hill, NJ (1997).
39. Y. Ye, A new complexity result on the minimization of a quadratic function with a sphere constraint, Technical Report, Princeton University, in: Recent Advances in Global Optimization (1992).
40. Y. Yuan, A dual algorithm for minimizing a quadratic function with two quadratic constraints, Technical Report DAMTP-NA3, University of Cambridge (1988).
41. Y. Zhang, Computing a Celis-Dennis-Tapia trust region step for equality constrained optimization, Technical Report, Rice University (1988).