Optimal strategies of the search for an extremum
From MaRDI portal
Publication:5670469
DOI10.1016/0041-5553(71)90008-5zbMath0255.90059OpenAlexW2079793731MaRDI QIDQ5670469
Publication date: 1973
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(71)90008-5
Related Items
On the worst-case optimal multi-objective global optimization, Stochastic global optimization methods part I: Clustering methods, On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization, A one-step worst-case optimal algorithm for bi-objective univariate optimization, Non-lattice Covering and Quantization of High Dimensional Sets, An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section, Global minimization of univariate functions by sequential polynomial approximation, MSO: a framework for bound-constrained black-box global optimization algorithms, Connected dominating sets on dynamic geometric graphs, Global optimization and polypeptide conformation, On the adaptive and continuous information problems, Optimal solution of nonlinear equations satisfying a Lipschitz condition, Pure random search with virtual extension of feasible region, The average a posteriori error of numerical methods, Cord-slope form of Taylor's expansion in univariate global optimization
