scientific article; zbMATH DE number 2078361

zbMATH Open1048.65065MaRDI QIDQ4474334FDOQ4474334

Authors: Sanja Singer, Saša Singer 

Publication date: 7 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• Efficient Implementation of the Nelder-Mead Search Algorithm
• Effect of dimensionality on the Nelder–Mead simplex method
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• A convergent variant of the Nelder--Mead algorithm
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point

zbMATH Keywords

optimizationperformanceconvergencenumerical examplescomplexitydirect search methodstermination criteriaNelder-Mead simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cited In (6)

• Quantile and mean value measures of search process complexity
• Detection of Local Differences in Spatial Characteristics Between Two Spatiotemporal Random Fields
• Efficient Implementation of the Nelder-Mead Search Algorithm
• Title not available (Why is that?)
• A simplex-based numerical framework for simple and efficient robust design optimization
• Title not available (Why is that?)

Uses Software

• subplex
• mctoolbox
• testmatrix

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474334)