scientific article; zbMATH DE number 1368022

DOI10.1002/(SICI)1099-0747(199903)15:1%3C77::AID-ASM361%3E3.0.CO;2-GMaRDI QIDQ4702176zbMATH OpenFDO

Authors Hisham Ahmad al-Mharman

Publication date 23 November 1999

Full work available at URL https://doi.org/10.1002/(SICI)1099-0747(199903)15:1%3C77::AID-ASM361%3E3.0.CO;2-G

zbMATH Keywords

adaptive algorithmsaverage performancebudget constraintcoordinate measuring machinenumerical simulationstochastic optimization

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Stochastic programming (90C15)

Recommendations

• Average performance of a class of adaptive algorithms for global optimization
• scientific article; zbMATH DE number 778105
• Averaging analysis of adaptive algorithms made simple
• The cost of deterministic, adaptive, automatic algorithms: cones, not balls
• Performance Analysis of the Adaptive Algorithm for Bias-to-Variance Tradeoff
• Adaptive approximations by greedy algorithms
• Convergence rate analysis for optimal computing budget allocation algorithms
• Publication:4508311

Cites work

• Average performance of a class of adaptive algorithms for global optimization
• Average performance of passive algorithms for global optimization
• Optimal random non-adaptive algorithm for global optimization of Brownian motion
• Statistical Issues in Geometric Feature Inspection Using Coordinate Measuring Machines

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 Q4702176)