|
REVIEWS AND DESCRIPTIONS OF TABLES AND BOOKS
Journal:
Math. Comp.
79,
1867-1869
DOI:
10.1090/S0025-5718-10-02379-3
PII:
S 0025-5718(10)02379-3
Posted:
February 12, 2010
Copyright of article:
Copyright
2010,
American Mathematical Society
Retrieve reviews in:
PDF
Introduction to derivative-free optimization,
by Andrew R. Conn, Katya Scheinberg and Luis N. Vicente
Additional book information:
SIAM,
Philadelphia, PA,
2009,
xii+277 pp.,
(softcover)
US$73.00,
ISBN 978-0-898716-68-9
2000
Mathematics Subject Classification.
Primary 65K05, 65K10
Reviewed by:
J.
L.
Nazareth
Affiliation:
University of Washington, Seattle, WA
E-mail address:
nazareth@amath.washington.edu
References:
-
- 1.
- R.P. Brent, Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, New Jersey, 1973 (reissued by Dover Publications, Mineola, New York, 2002). MR 0339493 (49:4251)
- 2.
- C.T. Kelley, Iterative Methods for Optimization, SIAM, Philadelphia, 1999. MR 1678201 (2000h:90003)
- 3.
- J.L. Nazareth, On algorithmic science and engineering: an emerging core discipline of computing, SIAM News, 39 (2006), No. 2, pp. 2-4.
- 4.
- J.A. Nelder and R. Mead, A simplex method for function minimization, Computer J., 7 (1965), pp. 308-313.
- 5.
- W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in FORTRAN: The Art of Scientific Computing, Cambridge University Press, Cambridge, England, 1992. MR 1196230 (93i:65001a)
|
