The DOI matches its Crossref record; 127 of the 127 references it cites were found in a registry or an index.
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Abstract
Direct search methods are best known as unconstrained optimization techniques that do not explicitly use derivatives. Direct search methods were formally proposed and widely applied in the 1960s but fell out of favor with the mathematical optimization community by the early 1970s because they lacked coherent mathematical analysis. Nonetheless, users remained loyal to these methods, most of which were easy to program, some of which were reliable. In the past fifteen years, these methods have seen a revival due, in part, to the appearance of mathematical analysis, as well as to interest in parallel and distributed computing. This review begins by briefly summarizing the history of direct search methods and considering the special properties of problems for which they are well suited. Our focus then turns to a broad class of methods for which we provide a unifying framework that lends itself to a variety of convergence results. The underlying principles allow generalization to handle bound constraints and linear constraints. We also discuss extensions to problems with nonlinear constraints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905 · cited 1×
“In section 4.1 we briefly discuss the Nelder–Mead simplex algorithm [194], probably the most widely cited of the direct search methods (the 1965 paper by Nelder and Mead is officially a Science Citation Classic), but we refer interested readers to [164] for a comprehensive modern treatment of the…”
MethodInfluentialRockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Empirical Model Building and Response Surfaces
Freeny, A. (1988) · Technometrics · doi:10.1080/00401706.1988.10488371 · Cited by 5,235
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 1×
“After evaluating f over the current lattice M, why not use the information accumulated during this search on M to construct a new set of generators that attempt to capture, at least locally, some curvature information? This is in the spirit of several of the early direct search methods such as Rosenbrock’s method of r…”
MethodA Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
On the Experimental Attainment of Optimum Conditions
Box, G. E. P., & Wilson, K. B. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-4380-9_23 · Cited by 3,448
Minuit - a system for function minimization and analysis of the parameter errors and correlations
James, F., & Roos, M. (1975) · Computer Physics Communications · doi:10.1016/0010-4655(75)90039-9 · Cited by 3,255
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
A class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
Himmelblau, D. M. (1972) · Cited by 2,532
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
Lipschitzian optimization without the Lipschitz constant
Jones, D. R., Perttunen, C. D., & Stuckman, B. E. (1993) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941892 · Cited by 1,976
Finite difference schemes and partial differential equations
(1991) · Choice Reviews Online · doi:10.5860/choice.28-2770 · Cited by 1,889
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,709
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.1080/00401706.1962.10490033 · Cited by 1,379
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Nonlinear Programming: Analysis and Methods
Avriel, M. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,339
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Self-citationA New Method of Constrained Optimization and a Comparison With Other Methods
Box, M. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.42 · Cited by 1,302
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Analysis of Generalized Pattern Searches
Audet, C., & Dennis, J. E. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400378742 · Cited by 1,022
A rigorous framework for optimization of expensive functions by surrogates
Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1999) · Structural Optimization · doi:10.1007/bf01197708 · Cited by 960
Self-citationDesign and Analysis of Industrial Experiments.
Freeman, H. A., Davies, O. L., Box, G. E. P., Connor, L. R., Cousins, W. R., Davies, O. L., Himsworth, F. R., & Sillitto, G. P. (1955) · Journal of the American Statistical Association · doi:10.2307/2280981 · Cited by 933
Variable Metric Method for Minimization
Davidon, W. C. (1991) · SIAM Journal on Optimization · doi:10.1137/0801001 · Cited by 892
Nonlinear programming without a penalty function
Fletcher, R., & Leyffer, S. (2002) · Mathematical Programming · doi:10.1007/s101070100244 · Cited by 874
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
A Method for Minimizing a Sum of Squares of Non-Linear Functions Without Calculating Derivatives
Powell, M. J. D. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.303 · Cited by 759
Finite Difference Schemes and Partial Differential Equations.
T., V., & Strikwerda, J. C. (1990) · Mathematics of Computation · doi:10.2307/2008454 · Cited by 753
Empirical Model-Building and Response Surfaces.
Pike, D. J., Box, G. E. P., & Draper, N. R. (1988) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982196 · Cited by 716
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
Self-citationNumerical Methods for Unconstrained Optimization and Nonlinear Equations.
Kass, R. E., Dennis, J. E., & Schnabel, R. B. (1985) · Journal of the American Statistical Association · doi:10.2307/2288097 · Cited by 602
Projected gradient methods for linearly constrained problems
Calamai, P. H., & Moré, J. J. (1987) · Mathematical Programming · doi:10.1007/bf02592073 · Cited by 588
Evolutionary Operation: A Method for Increasing Industrial Productivity
Box, G. E. P. (1957) · Applied Statistics · doi:10.2307/2985505 · Cited by 576
Direct search algorithms for optimization calculations
Powell, M. J. D. (1998) · Acta Numerica · doi:10.1017/s0962492900002841 · Cited by 558
Pattern Search Algorithms for Bound Constrained Minimization
Lewis, R. M., & Torczon, V. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623496300507 · Cited by 494
Self-citationConvergence of the Nelder--Mead Simplex Method to a Nonstationary Point
McKinnon, K. I. M. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303482 · Cited by 490
The Exploration and Exploitation of Response Surfaces: Some General Considerations and Examples
Box, G. E. P. (1954) · Biometrics · doi:10.2307/3001663 · Cited by 482
The Nelder-Mead Simplex Procedure for Function Minimization
Olsson, D. M., & Nelson, L. S. (1975) · Technometrics · doi:10.1080/00401706.1975.10489269 · Cited by 471
Chazan, D., & Miranker, W. (1969) · Linear Algebra and its Applications · doi:10.1016/0024-3795(69)90028-7 · Cited by 460
Optimization by direct search and systematic reduction of the size of search region
Luus, R., & Jaakola, T. H. I. (1973) · AIChE Journal · doi:10.1002/aic.690190413 · Cited by 450
ADIFOR–Generating Derivative Codes from Fortran Programs
Bischof, C., Carle, A., Corliss, G., Griewank, A., & Hovland, P. (1992) · Scientific Programming · doi:10.1155/1992/717832 · Cited by 436
Pattern Search Methods for Linearly Constrained Minimization
Lewis, R. M., & Torczon, V. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497331373 · Cited by 395
Self-citationBox, M. J. (1966) · The Computer Journal · doi:10.1093/comjnl/9.1.67 · Cited by 372
Adifor 2.0: automatic differentiation of Fortran 77 programs
Bischof, C., Khademi, P., Mauer, A., & Carle, A. (1996) · IEEE Computational Science and Engineering · doi:10.1109/99.537089 · Cited by 366
On search directions for minimization algorithms
Powell, M. J. D. (1973) · Mathematical Programming · doi:10.1007/bf01584660 · Cited by 338
Functional stability analysis of numerical algorithms
Rowan, T. H. (1990) · Cited by 336
On the Global Convergence of a Filter--SQP Algorithm
Fletcher, R., Leyffer, S., & Toint, P. L. (2002) · SIAM Journal on Optimization · doi:10.1137/s105262340038081x · Cited by 335
Simplex optimization of analytical chemical methods
Morgan, S. L., & Deming, S. N. (1974) · Analytical Chemistry · doi:10.1021/ac60345a035 · Cited by 334
A Locally-Biased form of the DIRECT Algorithm
Gablonsky, J. M., & Kelley, C. T. (2001) · Journal of Global Optimization · doi:10.1023/a:1017930332101 · Cited by 333
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
A controlled random search procedure for global optimisation
Price, W. L. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.367 · Cited by 323
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Lewis, R. M., & Torczon, V. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623498339727 · Cited by 315
Self-citationThe Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Carroll, C. W. (1961) · Operations Research · doi:10.1287/opre.9.2.169 · Cited by 313
Theory of Positive Linear Dependence
Davis, C. (1954) · American Journal of Mathematics · doi:10.2307/2372648 · Cited by 283
Algorithm AS 47: Function Minimization Using a Simplex Procedure
O'Neill, R. (1971) · Applied Statistics · doi:10.2307/2346772 · Cited by 283
Direct Search Methods on Parallel Machines
Dennis, J. E., & Torczon, V. (1992) · Operations Research ’91 · doi:10.1007/978-3-642-48417-9_2 · Cited by 279
Self-citationGoldstein, A. A. (1967) · Defense Technical Information Center (DTIC) · Cited by 267
Direct search methods: Once scorned, now respectable
Wright, M. H. (1996) · Cited by 264
On the Convergence of the Multidirectional Search Algorithm
Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801010 · Cited by 260
Self-citationRecent progress in unconstrained nonlinear optimization without derivatives
Conn, A. R., Scheinberg, K., & Toint, P. L. (1997) · Mathematical Programming · doi:10.1007/bf02614326 · Cited by 255
Non-linear optimization techniques;
Box, M. J., Davies, D., & Swann, W. H. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 251
Direct Search Methods on Parallel Machines
Dennis, Jr., & Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801027 · Cited by 251
Self-citationKelley, C. T. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497315203 · Cited by 232
Function Minimization Without Evaluating Derivatives--a Review
Fletcher, R. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.33 · Cited by 215
Multidirectional search: a direct search algorithm for parallel machines
Torczon, V. J., & Dennis, J. E. (1989) · Rice Research Repository (Rice University) · Cited by 201
Self-citationPerformance of the Super Modified Simplex
Routh, M. W., Swartz, P. A., & Denton, M. B. (1977) · Analytical Chemistry · doi:10.1021/ac50017a033 · Cited by 186
Pattern Search Algorithms for Mixed Variable Programming
Audet, C., & Dennis, J. E. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623499352024 · Cited by 179
(1977) · Operations research handbook · doi:10.1515/9783111506975-011 · Cited by 176
An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
Gilmore, P., & Kelley, C. T. (1995) · SIAM Journal on Optimization · doi:10.1137/0805015 · Cited by 171
Akitt, J. W. (1977) · The Computer Journal · doi:10.1093/comjnl/20.1.84 · Cited by 163
A Review of Minimization Techniques for Nonlinear Functions
Spang, H. A. (1962) · SIAM Review · doi:10.1137/1004089 · Cited by 162
Asynchronous Parallel Pattern Search for Nonlinear Optimization
Hough, P., Kolda, T. G., & Torczon, V. J. (2001) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599365823 · Cited by 161
Self-citationOn the convergence of derivative-free methods for unconstrained optimization
Conn, A., Scheinberg, K., & Toint, P. L. (1997) · Repository of the University of Namur · Cited by 152
A Convergent Variant of the Nelder–Mead Algorithm
Price, C. J., Coope, I. D., & Byatt, D. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1014849028575 · Cited by 135
Evolutionary Operation: A Statistical Method for Process Improvement
Ziegel, E. R., Box, G. E. P., & Draper, N. R. (1998) · Technometrics · doi:10.2307/1270554 · Cited by 130
An Algorithm using Quadratic Interpolation for Unconstrained Derivative Free Optimization
Conn, A. R., & Toint, P. L. (1996) · Springer eBooks · doi:10.1007/978-1-4899-0289-4_3 · Cited by 120
A derivative free optimization algorithm in practice
Conn, A. R., Scheinberg, K., & Toint, P. L. (1998) · AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference (MAO) · doi:10.2514/6.1998-4718 · Cited by 120
Pattern search algorithms for mixed variable general constrained optimization problems
Abramson, M. A., Dennis, J. E., & Audet, C. (2003) · Rice Research Repository (Rice University) · Cited by 111
Simplex techniques for nonlinear optimization
Ryan, P. B., Barr, R. L., & Todd, H. D. (1980) · Analytical Chemistry · doi:10.1021/ac50059a019 · Cited by 110
On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Lucidi, S., & Sciandrone, M. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623497330392 · Cited by 110
A Review of Simplex Optimization in Analytical Chemistry
Deming, S. N., Parker, L. R., & Denton, M. B. (1978) · C R C Critical Reviews in Analytical Chemistry · doi:10.1080/10408347808542701 · Cited by 109
Spiral--A new algorithm for non-linear parameter estimation using least squares
Jones, A. (1970) · The Computer Journal · doi:10.1093/comjnl/13.3.301 · Cited by 109
A Review of Simplex Optimization in Analytical Chemistry
Deming, S. N., Parker, L. R., & Denton, M. B. (1978) · Critical Reviews in Analytical Chemistry · doi:10.1080/10408347808085705 · Cited by 99
Wedge trust region methods for derivative free optimization
Marazzi, M., & Nocedal, J. M. (2002) · Mathematical Programming · doi:10.1007/s101070100264 · Cited by 98
Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm
Dennis, J. E., E., W. J., & Daniel, J. (1985) · doi:10.21236/ada453814 · Cited by 97
Fortified-Descent Simplicial Search Method: A General Approach
Tseng, P. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623495282857 · Cited by 89
Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
Kiefer, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105009 · Cited by 86
A New Method for Minimising a Sum of Squares without Calculating Gradients
Peckham, G. E. (1970) · The Computer Journal · doi:10.1093/comjnl/13.4.418 · Cited by 82
Kokkolaras, M., Audet, C., & Dennis, J. E. (2001) · Optimization and Engineering · doi:10.1023/a:1011860702585 · Cited by 80
Reflections on the modified simplex—II1
Betteridge, D., Wade, A. P., & Howard, A. G. (1985) · Talanta · doi:10.1016/0039-9140(85)80175-2 · Cited by 75
Optimization of Microwave Networks by Razor Search
Bandler, J. W., & Macdonald, P. A. (1969) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.1969.1127006 · Cited by 69
Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search
Nazareth, L., & Tseng, P. (2002) · Computational Optimization and Applications · doi:10.1023/a:1014842520519 · Cited by 67
A grid algorithm for bound constrained optimization of noisy functions
Elster, C., & Neumaier, A. (1995) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/15.4.585 · Cited by 60
Generalized pattern searches with derivative information
Abramson, M. A., Audet, C., & Dennis, J. E. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0484-5 · Cited by 60
New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
García‐Palomares, U. M., & Matas, J. F. R. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400370606 · Cited by 60
Chipot, C. J., Kollman, P. A., & Pearlman, D. A. (1996) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(19960715)17:9<1142::aid-jcc6>3.0.co;2-s · Cited by 58
A Direct Search Algorithm for Optimization with Noisy Function Evaluations
Anderson, E. J., & Ferris, M. C. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623496312848 · Cited by 54
Scattering of Positive Pions by Hydrogen at 189 Mev
Anderson, H. L., Davidon, W. C., Glicksman, M., et al. (1955) · Physical Review · doi:10.1103/physrev.100.279 · Cited by 51
Constrained Nonlinear Optimization by Heuristic Programming
Paviani, D. A., & Himmelblau, D. M. (1969) · Operations Research · doi:10.1287/opre.17.5.872 · Cited by 47
On the Convergence of Asynchronous Parallel Pattern Search
Kolda, T. G., & Torczon, V. J. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623401398107 · Cited by 47
Self-citationA superlinearly convergent algorithm for minimization without evaluating derivatives
Mifflin, R. B. (1975) · Mathematical Programming · doi:10.1007/bf01681333 · Cited by 46
A Nongradient and Parallel Algorithm for Unconstrained Minimization
Chazan, D., & Miranker, W. L. (1970) · SIAM Journal on Control · doi:10.1137/0308015 · Cited by 44
On the Lagrange functions of quadratic models that are defined by interpolation*
Powell, M. J. D. (2001) · Optimization methods & software · doi:10.1080/10556780108805839 · Cited by 41
UNIPLEX. Single-factor optimization of response in the presence of error
King, P. G., & Deming, S. N. (1974) · Analytical Chemistry · doi:10.1021/ac60347a009 · Cited by 40
The symmetry-controlled simplex optimization procedure
van der Wiel, P. F. A., Maassen, R., & Kateman, G. (1983) · Analytica Chimica Acta · doi:10.1016/s0003-2670(00)85490-2 · Cited by 23
Remark AS R28: A Remark on Algorithm AS 47: Function Minimization Using a Simplex Procedure
Hill, I. D. (1978) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347187 · Cited by 15
Numerical Results for Unconstrained Optimization without Derivatives
Lucidi, S., & Sciandrone, M. (1996) · Springer eBooks · doi:10.1007/978-1-4899-0289-4_18 · Cited by 7
Techniques and performance of the advanced regular simplex method
Shao, M. H. (1991) · Analytica Chimica Acta · doi:10.1016/s0003-2670(00)80866-1 · Cited by 5
THE SIMPLEX METHOD FOR MINIMISATION OF A GENERAL FUNCTION
Walmsley, D. A. (1981) · Publication of: Transport and Road Research Laboratory · Cited by 1
Cited by
Rich Models for Steganalysis of Digital Images
Fridrich, J., & Kodovsky, J. (2012) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2012.2190402 · Cited by 2,144
“compass search [31] that minimizes (10).”
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Audet, C., & Dennis, J. E. (2006) · SIAM Journal on Optimization · doi:10.1137/040603371 · Cited by 1,243
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
Metadata
- Authors
- Kolda, T. G., Lewis, R. M., & Torczon, V.
- Venue
- SIAM Review
- Published
- 2003-01
- Volume
- 45
- Issue
- 3
- Pages
- 385-482
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2162737890
- Cited by
- 1,653
- References
- 127
- FWCI
- 39.54
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.