Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
DOI10.1016/0167-6377(85)90049-5zbMATH Open0568.90082OpenAlexW2169145368MaRDI QIDQ1061007FDOQ1061007
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90049-5
Recommendations
convergencemultimodal optimizationaxiomatic characterizationglobal minimizationstatistical model of the objective function
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
Cited In (21)
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- On the Asymptotic Tractability of Global Optimization
- On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Bi-objective decision making in global optimization based on statistical models
- On similarities between two models of global optimization: Statistical models and radial basis functions
- Bayesian methods in global optimization
- Title not available (Why is that?)
- P-algorithm based on a simplicial statistical model of multimodal functions
- On a global optimization algorithm for bivariate smooth functions
- A review of statistical models for global optimization
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- On the convergence of the P-algorithm for one-dimensional global optimization of smooth functions
- A statistical model for global optimization by means of select and clone
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- Adaptive approximation of the minimum of Brownian motion
- Global optimization based on a statistical model and simplicial partitioning.
- A one-dimensional optimization algorithm and its convergence rate under the Wiener measure
- A hybrid of Bayesian approach based global search with clustering aided local refinement
This page was built for publication: Axiomatic characterization of a global optimization algorithm and investigation of its search strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061007)