Parameter sensitivity of deterministic and stochastic search methods

MaRDI QIDQ3840418zbMATH OpenFDO

Authors K.-J. Böttcher

Publication date 10 August 1998

zbMATH Keywords

computer stop watchexperimental studyimportance of time optimal parametermeasured optimization timeparameter sensitivity of optimization methodssensitivitystochastic and deterministic search methods

Mathematics Subject Classification ID

Stochastic programming (90C15) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• An adaptive search algorithm for numerical optimization
• scientific article; zbMATH DE number 3999669
• scientific article; zbMATH DE number 4061014
• Optimal order of accuracy of search algorithms in stochastic optimization
• Speed of convergence as a function of given accuracy for random search methods

Cited in

(7)

• A search grid for parameter optimization as a byproduct of model sensitivity analysis
• Exhaustive versus randomized searches for nonlinear optimization in 21st century computing: solar application
• scientific article; zbMATH DE number 176415 (Why is no real title available?)
• Parameters estimation of the Rakhmatov and Vrudhula model from the optimization method search in improved network
• The New Arsti Optimization Method: Adaptive Random Search with Translating Intervals
• Hybrid search for optimum in a small implicitly defined region
• A combined topographical search strategy with ellipsometric application

This page was built for publication: Parameter sensitivity of deterministic and stochastic search methods

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