An efficient method for finding the minimum of a function of several variables without calculating derivatives
Powell, M. J · 1964
Earlier work this paper cites.
A simplex method for function minimization
Nelder, J. A. & Mead, R · 1965
Earlier work this paper cites.
Note sur la convergence de méthodes de directions conjuguées
Polak, E. & Ribiere, G · 1969
Earlier work this paper cites.
A new algorithm for unconstrained optimization
Powell, M. J · 1970
Earlier work this paper cites.
A new method of interpolation and smooth curve fitting based on local procedures
Akima, H · 1970
Earlier work this paper cites.
A practical guide to splines (Springer-Verlag, 1978)
de Boor, C · 1978
Earlier work this paper cites.
User guide for MINPACK-1
Moré, J. J., Garbow, B. S. & Hillstrom, K. E · 1980
Earlier work this paper cites.
Monotone piecewise cubic interpolation
Fritsch, F. N. & Carlson, R. E · 1980
Earlier work this paper cites.
Vectorizing the FFTs
Swarztrauber, P. N · 1982
Earlier work this paper cites.
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 1: Convergence analysis
Schittkowski, K · 1982
Earlier work this paper cites.
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. Part 2: An efficient implementation with linear least squares subproblems
Schittkowski, K · 1982
Earlier work this paper cites.
ODEPACK, a systematized collection of ODE solvers
Hindmarsh, A. C · 1983
Earlier work this paper cites.
QUADPACK: a subroutine package for automatic integration (Springer-Verlag, New York, NY, USA, 1983)
Piessens, R., de Doncker-Kapenga, E., Überhuber, C. W. & Kahaner, D. K · 1983
Earlier work this paper cites.
On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function
Schittkowski, K · 1983
Earlier work this paper cites.
The conjugate gradient method and trust regions in large scale optimization
Steihaug, T · 1983
Earlier work this paper cites.
Computing a trust region step
Moré, J. J. & Sorensen, D. C · 1983
Earlier work this paper cites.
FFT algorithms for vector computers
Swarztrauber, P. N · 1984
Earlier work this paper cites.
Newton-type minimization via the Lanczos method
Nash, S. G · 1984
Earlier work this paper cites.
Algorithm 644: A portable package for Bessel functions of a complex argument and nonnegative order
Amos, D. E · 1986
Earlier work this paper cites.
The C Programming Language (Prentice Hall Professional Technical Reference, 1988), 2nd edn
Kernighan, B. W · 1988
Earlier work this paper cites.
A software package for sequential quadratic programming
Kraft, D · 1988
Earlier work this paper cites.
NetCDF: an interface for scientific data access
Rew, R. & Davis, G · 1990
Earlier work this paper cites.
The guide to available mathematical software problem classification system
Boisvert, R. F., Howe, S. E. & Kahaner, D. K · 1991
Earlier work this paper cites.
Users’ guide for the Harwell-Boeing sparse matrix collection (Release I) (1992)
Duff, I. S., Grimes, R. G. & Lewis, J. G · 1992
Earlier work this paper cites.
User’s Reference Guide for ODRPACK Version 2.01: Software for Weight Orthogonal Distance Regression (U.S. Department of Commerce, National Institute of Standards and Technology, 1992)
Boggs, P. T., Byrd, R. H., Rogers, J. E. & Schnabel, R. B · 1992
Earlier work this paper cites.
Curve and Surface Fitting with Splines (Oxford University Press, Inc., New York, NY, USA, 1993)
Dierckx, P · 1993
Earlier work this paper cites.
The High Performance FORTRAN Handbook (MIT Press, Cambridge, MA, USA, 1993)
Koelbel, C. H. & Zosel, M. E · 1993
Earlier work this paper cites.
A direct search optimization method that models the objective and constraint functions by linear interpolation
Powell, M. J · 1994
Earlier work this paper cites.
The matrix object proposal (very long) (1995)
Hugunin, J · 1995
Earlier work this paper cites.
Extending Python for numerical computation (1995)
Hugunin, J · 1995
Earlier work this paper cites.
Presolving in linear programming
Andersen, E. D. & Andersen, K. D · 1995
Earlier work this paper cites.
A limited memory algorithm for bound constrained optimization
Byrd, R. H., Lu, P., Nocedal, J. & Zhu, C · 1995
Earlier work this paper cites.
The quickhull algorithm for convex hulls
Barber, C. B., Dobkin, D. P. & Huhdanpaa, H · 1996
Earlier work this paper cites.
Direct search methods: Once scorned, now respectable
Wright, M. H · 1996
Earlier work this paper cites.
At Mathworks, support + fun = success: CEO Jack Little believes in power of his workers – and their ideas (20 Apr. 1997)
Blanton, K · 1997
Earlier work this paper cites.
Matrix Market: a web resource for test matrix collections
Boisvert, R. F., Pozo, R., Remington, K., Barrett, R. F. & Dongarra, J. J · 1997
Earlier work this paper cites.
ARPACK users’ guide: Solution of large scale eigenvalue problems with implicitly restarted Arnoldi methods
Lehoucq, R. B., Sorensen, D. C. & Yang, C · 1997
Earlier work this paper cites.
Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces
Storn, R. & Price, K · 1997
Earlier work this paper cites.
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P. & Nocedal, J · 1997
Earlier work this paper cites.
Direct search algorithms for optimization calculations
Powell, M. J · 1998
Earlier work this paper cites.
Some Python modules (1999)
Oliphant, T. E · 1999
Earlier work this paper cites.
SuperLU users’ guide
Li, X. et al · 1999
Earlier work this paper cites.
Analysis of approximate nearest neighbor searching with clustered point sets (1999)
Maneewongvatana, S. & Mount, D. M · 1999
Earlier work this paper cites.
LAPACK Users’ Guide (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999), 3rd edn
Anderson, E. et al · 1999
Earlier work this paper cites.
Characterization of structures from X-ray scattering data using genetic algorithms
Wormington, M., Panaccione, C., M., M. K. & Bowen, D. K · 1999
Earlier work this paper cites.
Solving the trust-region subproblem using the Lanczos method
Gould, N. I. M., Lucidi, S., Roma, M. & Toint, P. L · 1999
Earlier work this paper cites.
Modules to enhance numerical Python (2000)
Oliphant, T. E · 2000
Earlier work this paper cites.
Python modules (2000)
Strangman, G · 2000
Earlier work this paper cites.
The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm
Andersen, E. D. & Andersen, K. D · 2000
Earlier work this paper cites.
Trust Region Methods (SIAM, 2000)
Conn, A. R., Gould, N. I. & Toint, P. L · 2000
Earlier work this paper cites.