1 BROYDEN, C.G; DENNIS , J.E. Jr; MORÉ, J.J. [1973]: On the local and superlinear convergence of Quasi-Newton methods, J. Inst. Math. Appl. 12, p. 223-245.
2 BUCKLEY, A.; LENIR, A. [1983]: QN-Like variable storage conjugate gradients, Mathematical Programming 27, p.
155-175.
3 _____ [1985]: BBVSCG - A variable storage algorithm minimization, ACM Transactions on Mathematical Software 11/2, p. 103-119.
4 CONN, A. R.; GOULD, N. I. M.; TOINT, Ph. L. [1988]: Global Convergence of a class of trust region algorithms for optimization with simple bounds, SIAM Journal on Numerical Analysis 25, p. 433-245.
5 _____ [1989]: Testing a class of methods for solving minimization problems with simple bounds on the variables, Mathematics of Computation 50, p. 399-430.
6 DENNIS, J. E.Jr. [1971]: Towards a unified convergence theory for Newton-like methods. Nonlinear Functional Analysis and Applications , Academic Press, Nova York, p. 425-472.
7 DENNIS, J. E. Jr.; MORÉ, J. J. [1974]: A characterization of superlinear convergence and its application to Quasi-Newton Methods, Math. Comp. 28, p. 549-560.
8 _____ [1977]: Quasi-Newton Methods, motivation and theory, SIAM Review 19, p. 46-89.
9 DENNIS, J. E. Jr.; SCHNABEL, R. B., [1979]: Least change secant updates for Quasi-Newton methods, SIAM Review 21, p. 443-459.
10 _____ [1983]: Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice Hall Englewood Cliffs, New Jersey.
11 _____ [1989]: A View of Unconstrained Optimization, chapter 1, in Optimization (v. 1), Handbooks in Operations Research Management Science, G. L. Nemhauser, A. H. G.; Rinnoy Kan and M. J. Todd. (Eds.) North-Holland, Amsterdan-New York-Oxford-Tokyo.
12 DENNIS, J. E. Jr and WALKER, H. F. [1981]: Convergence theorems for least-change secant update Methods, SIAM J. on Num. Anal. 18, p. 949-987.
13 DONGARRA, J. J.; BUNCH J. R.; MOLER, C. B.; STEWART, G. W. [1979]: LINPACK Users Guide, SIAM Publications, Philadelphia.
14 DUFF, I. S.; ERISMAN, A. M.; REID, J. K. [1986]: Direct methods for sparse matrices, Clarendon Press, Oxford.
15 FIACCO, A.V.; McCORMICK, G. P. [1968]: Nonlinear Programming Sequential Unconstrained Minimization Techniques, John Wiley and Sons, Inc, New York - London - Sidney - Toronto.
16 FLETCHER, R. [1987]: Practical Methods of Optimization
(2nd edition), John Wiley and Sons, Chichester - New York - Brisbane - Toronto
- Singapore.
17 FRIEDLANDER,A.; MARTÍNEZ J. M.; SANTOS, S. A. [1994]:
A new-trust region algorithm for bound constrained minimization, Applied
Mathematics and Optimization 30,p. 235-266.
18 GAY, D. M. [1981]: Computing optimal locally constrained steps, SIAM J. Sci., Stat. Comput. 2, p. 186-197.
19 GILBERT, J. C.; LEMARÉCHAL, C. [1988]: Some numerical experiments with variable storage Quasi-Newton algorithms, IISA Working Paper WP-88, A - 2361, Luxenbourg.
20 GILL, P. E.; MURRAY, E.; WRIGHT, M. H. [1981]: Practical Optimization, Academic Press, London - New York.
21 GOLUB, G. H.; VAN LOAN, Ch. F. [1991]: Matrix Computation (2nd edition). The John Hopkins University Press, Baltimore - London.
22 LIU, D. C.; NOCEDAL, J. [1988]: On the limited memory BFGS method for large scale optimization, TRNEM 03, Northwestern University, Dept. Electrical Engineering.and Computer Science.
23 LUENBERGER, D. G. [1984]: Linear and Nonlinear Programming (2nd edition). Addison - Wesley Publishing Company.
24 MARTÍNEZ, J. M. [1990]: Local convergence theory of Inexact Newton methods based on structured least change updates, Mathematics of Computation 55, p. 143-167.
25 MARTÍNEZ, J. M.; SANTOS, S. A. [1995]: A trust region strategy for minimization on arbitrary domains, Mathematical Programming 68, p.267-302
26 McCORMICK, G. P. [1983]: Nonlinear Programming, John Wiley and Sons, New York - Chichester - Brisbane - Toronto - Singapore.
27 MEURANT, Gérard [1992]: The evolution of computing on parallel computers, Anais da I Escola de Computação Científica de Alto Desempenho, 3 a 7 de agosto de 1992, LNCC - Rio de Janeiro.
28 MORÉ, J. J.; GARBOW, B. S.; HILLSTRON, K. E. [1981]: Testing unconstrained optimization software, ACM Transactions on Mathematical Software 7, p. 17-41.
29 MORÉ, J. J.; SORENSEN, D. C. [1983]: Computing a trust region step, SIAM J. Sci, Stat. Comput. 4, p. 553-572.
30 NOCEDAL, J. [1980]: Updating Quasi-Newton matrices with limited storage, Mathematics of Computation, p. 773-782.
31 POWELL, M. J. D. [1984]: On the global convergence of trust region algorithms for unconstrained minimization, Mathematical Programming 29, p. 297-303.
32 REDDY, J. N. [1987]: The penalty-finite element, in Finite Element Handbook,:H Kardestuncer (End.), McGraw Hill Book Company.
33 SCHULTZ, G. A.; R. B. SCHNABEL and R. H. BYRD [1985]: A family of trust region based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Num. Anal.22, p.47-67.
34 SORENSEN, D. C. [1982]: Newton's method with a model trust region modification, SIAM J. Numer. Anal. 19, p. 409-426.
35 STRANG, G. [1988]: Linear Algebra and its Applications (3rd edition), Harcourt Brace Jovanovich Publishers, San Diego.
36 STEIHAUG, T. [1983]: The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal. 20, p. 626-637.
37 TOINT, Ph. L.[1988]: Global convergence of a class of trust-region methods for nonconvex minimization in Hilbert space, IMA Journal of Numerical Analysis 8, p. 231-252.
38 TOUATI-AHMED, D.; STOREY, C. [1990]: Efficient hybrid conjugate gradient techniques, JOTA, vol. 64-2.
39 WATKINS, D. S. [1991]: Fundamentals of Matrix Computations, John Wiley and Sons, Inc, New-York - Toronto.
40 ZAMBALDI, M. C. [1993]: Novos Resultados Sobre Fórmulas
Secantes e Aplicações - Tese de Doutorado - DMA - IMECC
- UNICAMP - Campinas -São Paulo.