fminsearch

Convergence properties of the Nelder--Mead simplex method in low dimensions The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder--Mead algorithm. This paper presents convergence properties of the Nelder--Mead algorithm applied to strictly convex functions in dimensions 1 and 2. We prove convergence to a minimizer for dimension 1, and various limited convergence results for dimension 2. A counterexample of McKinnon gives a family of strictly convex functions in two dimensions and a set of initial conditions for which the Nelder--Mead algorithm converges to a nonminimizer. It is not yet known whether the Nelder--Mead method can be proved to converge to a minimizer for a more specialized class of convex functions in two dimensions.


References in zbMATH (referenced in 221 articles , 1 standard article )

Showing results 1 to 20 of 221.
Sorted by year (citations)

1 2 3 ... 10 11 12 next

  1. Albrecht, Gudrun; Caliò, Franca; Miglio, Edie: Geometrically constrained surface (re)construction (2019)
  2. Dobrev, Veselin; Knupp, Patrick; Kolev, Tzanio; Mittal, Ketan; Tomov, Vladimir: The target-matrix optimization paradigm for high-order meshes (2019)
  3. Dong, Jiaqi; Chen, Weiqi; Zeng, Zhe; Qin, Qing-Hua; Xiao, Yi: Analysis of wave band gaps in mechanical metamaterial based on Nelder-Mead method (2019)
  4. Fajfar, Iztok; Bűrmen, Árpád; Puhan, Janez: The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization (2019)
  5. Gomes, Susana N.; Stuart, Andrew M.; Wolfram, Marie-Therese: Parameter estimation for macroscopic pedestrian dynamics models from microscopic data (2019)
  6. Imakura, Akira: Minimal residual-like condition with collinearity for shifted Krylov subspace methods (2019)
  7. Li, Dongmin; Hu, Qingpei; Wang, Lujia; Yu, Dan: Statistical inference for (M_t/G/)\textitInfinityqueueing systems under incomplete observations (2019)
  8. Morais, J. V.; Custódio, A. L.; Marques, G. M.: Calibration of parameters in dynamic energy budget models using direct-search methods (2019)
  9. Nguyen, Nhu; Yvonnet, J.; Réthoré, J.; Tran, A. B.: Identification of fracture models based on phase field for crack propagation in heterogeneous lattices in a context of non-separated scales (2019)
  10. Riaz, Bilal; Shuang, Cong; Qamar, Shahid: Optimal control methods for quantum gate preparation: a comparative study (2019)
  11. Stojsavljevic, Thomas; Pinter, Gabriella; Lauko, Istvan; Myers, Nicholas: Parameter identification and sensitivity analysis for a phytoplankton competition model (2019)
  12. Uhlig, Frank: The construction of high order convergent look-ahead finite difference formulas for Zhang neural networks (2019)
  13. Wessing, Simon: Proper initialization is crucial for the Nelder-Mead simplex search (2019)
  14. Yang, Kaifeng; Emmerich, Michael; Deutz, André; Bäck, Thomas: Efficient computation of expected hypervolume improvement using box decomposition algorithms (2019)
  15. Ahi, Emrah; Akgiray, Vedat; Sener, Emrah: Robust term structure estimation in developed and emerging markets (2018)
  16. Ahookhosh, Masoud; Neumaier, Arnold: Solving structured nonsmooth convex optimization with complexity (\mathcalO(\varepsilon^-1/2)) (2018)
  17. Audet, Charles; Tribes, Christophe: Mesh-based Nelder-Mead algorithm for inequality constrained optimization (2018)
  18. Ban, Jaepil; Kwon, Wookyong; Won, Sangchul; Kim, Sangwoo: Robust (H_\infty) finite-time control for discrete-time polytopic uncertain switched linear systems (2018)
  19. Boem, Francesca; Zhou, Yilun; Fischione, Carlo; Parisini, Thomas: Distributed Pareto-optimal state estimation using sensor networks (2018)
  20. Chagas, T. P.; Bliman, P.-A.; Kienitz, K. H.: Stabilization of periodic orbits of discrete-time dynamical systems using the prediction-based control: new control law and practical aspects (2018)

1 2 3 ... 10 11 12 next