A trust-region approach to nonlinear systems of equalities and inequalities

SIAM Journal on Optimization

Volumn 9, Issue 2, 1999, Pages 291-315

  Dennis Jr , J E ^a   El Alem, Mahmoud ^a,b   Williamson, Karen ^c  

^a RICE UNIVERSITY   (United States)

^b Alexandria University Faculty Of Science   (Egypt)

^c TDA RESEARCH INC   (United States)

Author keywords

Active set strategies; Fraction of Cauchy decrease; Global convergence; Multimodel algorithm; Nonlinear least squares; Nonlinear systems; One sided least squares; System of inequalities; Trust region methods

Indexed keywords

EID: 0033413991     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494276208     Document Type: Article

References (37)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMALING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK User's Guide, SIAM, Philadelphia, PA, 1992.
2. J. T. BETTS, W. P. HUFFMAN, AND D. P. YOUNG, An investigation of algorithm performance for aerodynamic design optimization, Tech. report BCSTECH-94-061, Boeing Computer Services, Boeing Company, Seattle, WA, 1994.
3. I. BONGARTZ, A. R. CONN, N. GOULD, AND PH. L. TOINT, CUTE: Constrained and unconstrained testing environment, Tech. report 18860, IBM T.J. Watson Research Center, Yorktown, NY, 1993.
4. M. A. BRANCH, Getting CUTE with Matlab, Tech. report CTC94TR194, Department of Computer Science, Cornell University, Ithaca, NY, 1994.
5. J. BURKE Algorithms for Solving Finite Dimensional Systems of Nonlinear Equations and Inequalities that have Both Global and Quadratic Convergence Properties, Tech. report ANL/MCS-TM-54, Mathematics and Computer Science Division, Argonne National Laboratory, Chicago, IL, 1985.
6. J. BURKE AND S. P. HAN, A Gauss-Newton approach to solving generalized inequalities, Math. Oper. Res., 11 (1986), pp. 632-643.
7. J. V. BURKE AND M. C. FERRIS, A Gauss-Newton method for convex composite optimization, Tech. report 1176, Center for Parallel Optimization, Computer Sciences, University of Wisconsin, Madison, WI, 1993.
8. R. CARTER, Multi-Model Algorithms for Optimization, Ph.D. thesis, Department of Mathematical Sciences, Rice University, Houston, TX, 1986.
9. R. CARTER, On the global convergence of trust region algorithms using inexact gradient information, SIAM J. Numer. Anal., 28 (1991), pp. 251-265.
10. A. R. CONN, N. I. GOULD, A. SARTENAER, AND PH. L. TOINT, Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints, SIAM J. Optim., 3 (1993), pp. 164-221.
11. A. R. CONN, N. I. GOULD, AND PH. L. TOINT, LANCELOT: a Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Ser. Comput. Math. 17, Springer-Verlag, Heidelberg, Berlin, New York, 1992.
12. J. W. DANIEL, Newton's method for nonlinear inequalities, Numer. Math., 40 (1973), pp. 381-387.
13. J. E. DENNIS, JR., AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
14. J. E. DENNIS, JR., AND R. B. SCHNABEL, A View of Unconstrained Optimization, Handbooks Oper. Res. Management Sci. 1, North-Holland, Amsterdam, 1989.
15. U. M. GARCIA-PALOMARES, On the Minimax Solution of a Nonlinear System of Mixed Equalities and Inequalities, Tech. report, Departmento de procesos y sistemas, Universidad Simon Bolivar, Caracas, Venezuela, 1983.
16. U. M. GARCIA-PALOMARES AND A. RESTUCCIA, A global quadratic algorithm for solving a system of mixed equalities and inequalities, Math. Programming, 21 (1981), pp. 290-300.
17. G. H. GOLUB AND U. VON MATT, Quadratic constrained least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
18. W. HOCK AND K. SCHITTKOWSKI, Test Examples for Nonlinear Programming Codes, Lecture Notes in Econom. and Math. Systems 187, Springer-Verlag, Berlin, 1981.
19. E. H. KAUFMAN AND G. D. TAYLOR, Linearly constrained generalized rational approximation, in Approximation Theory VI: Vol. 2, C. K. Chui, L. L. Schumaker, and J. D. Ward, eds., Academic Press, New York, 1989, pp. 353-356.
20. K. LEVENBERG, A method for the solution of certain problems in least squares, Quart. Appl. Math., 2 (1944), pp. 164-168.
21. D. MARQUARDT, An algorithm for least-squares estimation of nonlinear parameters, SIAM J. Appl. Math., 11 (1963), pp. 431-441.
22. J. J. MORÉ, The Levenberg-Marquardt algorithm: Implementation and theory, in Proceedings of the Dundee Conference on Numerical Analysis, G. A. Watson, ed., Springer-Verlag, Berlin, New York, 1978, pp. 105-116.
23. J. J. MORÉ, Recent developments in algorithms and software for trust region methods, in Mathematical Programming, The State of the Art, A. Bachem, M. Grotschel, and B. Korte, eds Springer-Verlag, New York, 1983, pp. 258-287.
24. J. J. MORÉ, B. S. GARBOW, AND K. E. HILLSTROM, User Guide for MINPACK-1, Tech. report ANL-80-74, Argonne National Laboratory, Argonne, IL, 1980.
25. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
26. M. R. OSBORNE, Finite Algorithms for Optimization and Data Analysis, John Wiley, New York, 1985.
27. M. R. OSBORNE, S. A. PRUESS, AND R. S. WOMERSLEY, Concise representation of generalized gradients, J. Austral. Math. Soc. Ser. B, 28 (1986), pp. 57-74.
28. B. T. POLYAK, Gradient methods for solving equations and inequalities, USSR Comput. Math., 4 (1964), pp. 17-32.
29. M. J. D. POWELL Convergence properties of a class of minimization algorithms, in Nonlinear Programming 2, O. Mangasarian, R. Meyer, and S. Robinson, eds., Academic Press, New York, 1975, pp. 1-27.
30. M. J. D. POWELL, On the global convergence of trust region algorithms for unconstrained optimization, Math. Programming, 29 (1984), pp. 297-303.
31. B. N. PSHENICHNYI, Newton's method for the solution of systems of equalities and inequalities, Math. Notes Acad. Sci. USSR, 8 (1970), pp. 827-830.
32. S. M. ROBINSON, Extension of Newton's method to nonlinear functions with values in a cone, Numer. Math., 19 (1972), pp. 341-347.
33. K. SCHITTKOWSKI, More Test Examples for Nonlinear Programming Codes, Lecture Notes in Econom. and Math. Systems 282, Springer-Verlag, Berlin, 1987.
34. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
35. G. D. TAYLOR, Uniform approximation with side conditions, in Approximation Theory, G. G. Lorentz, ed., Academic Press, New York, 1973, pp. 481-484.
36. PH. L. TOINT, Global convergence of a class of trust region methods for non-convex minimization in Hilbert spaces, IMA J. Numer. Anal., 8 (1988), pp. 231-252.
37. PH. L. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, Tech. report 80/4, Departément de Mathématique, Facultés Universitaires de Namur, Belgium, 1980.