A dimension-reducing method for unconstrained optimization

Journal of Computational and Applied Mathematics

Volumn 66, Issue 1-2, 1996, Pages 239-253

  Grapsa, T N ^a   Vrahatis, M N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Bisection method; Dimension reducing method; Imprecise gradient values; Quadratic convergence; Reduction to one dimensional equations; Unconstrained optimization

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; FINITE DIFFERENCE METHOD; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS;

DIMENSION REDUCING METHOD; IMPRECISE GRADIENT VALUES; QUADRATIC CONVERGENCE; UNCONSTRAINED OPTIMIZATION;

OPTIMIZATION;

EID: 0029709294     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-0427(95)00174-3     Document Type: Article

References (20)

1. L. Armijo, Minimization of functions having Lipschitz continuous first partial derivatives, Pacific. J. Math. 16 (1966) 1-3.
2. R.P. Brent, Some efficient algorithms for solving systems of nonlinear equations, SIAM J. Numer. Anal. 10 (1973) 327-366.
3. K.M. Brown, Computer oriented algorithms for solving systems of simultaneous nonlinear algebraic equations, in: G.D. Byrne and C.A. Hall, Eds., Numerical Solution of Systems of Nonlinear Algebraic Equations (Academic Press, New York, 1973).
4. J.E. Dennis Jr. and R.B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983).
5. D.M. Gay, Brown's method and some generalizations with applications to minimization problems, Ph.D. Thesis, Cornell Univ., 1975.
6. 2, Internat. J. Comput. Math. 28 (1989) 171-181.
7. n, Internat. J. Comput. Math. 32 (1990) 205-216.
8. T.N. Grapsa and M.N. Vrahatis, A new dimension-reducing method for solving systems of nonlinear equations, Internat. J. Comput. Math. 55 (1995) 235-244.
9. n + 1, Internat. J. Comput. Math. 35 (1990) 133-151.
10. D. Kavvadias and M.N. Vrahatis, Locating and computing all the simple roots and extrema of a function, SIAM J. Sci. Comput., accepted.
11. M. Kupferschmid and J.G. Ecker, A note on solution of nonlinear programming problems with imprecise function and gradient values, Math. Programming Stud. 31 (1987) 129-138.
12. B.J. Moré, B.S. Garbow and K.E. Hillstrom, Testing unconstrained optimization, ACM Trans. Math. Software 7 (1981) 17-41.
13. J.M. Ortega, Numerical Analysis (Academic Press, New York, 1972).
14. J.M. Ortega and W.C. Rheinbolt, Iteration Solution of Nonlinear Equations in Several Variables (Academic Press, New York, 1970).
15. W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery, Numerical Recipes, The Art of Scientific Computing (Cambridge Univ. Press, New York, 2nd ed., 1992).
16. K. Sikorski, Bisection is optimal, Numer. Math. 40 (1982) 111-117.
17. M.N. Vrahatis, Solving systems of nonlinear equations using the nonzero value of the topological degree, ACM Trans. Math. Software 14 (1988) 312-329.
18. M.N. Vrahatis, CHABIS: a mathematical software package for locating and evaluating roots of systems of nonlinear equations, ACM Trans. Math. Software 14 (1988) 330-336.
19. M.N. Vrahatis, A short proof and a generalization of Miranda's existence theorem, Proc. Amer. Math. Soc. 107 (1989) 701-703.
20. M.N. Vrahatis, G.S. Androulakis and G.E. Manoussakis, A new unconstrained optimization method for imprecise function and gradient values, J. Math. Anal. Appl., accepted.