Lower bounds on the noiseless worst-case complexity of efficient global optimization

DOI10.1007/S10957-024-02399-1MaRDI QIDQ6536837zbMATH OpenFDO

Authors Wenjie Xu, Y. Jiang, Emilio Tanowe Maddalena, Colin N. Jones

Publication date 14 May 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-024-02399-1

zbMATH Keywords

efficient global optimizationreproducing kernel Hilbert spaceworst-case complexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Convergence rates of efficient global optimization algorithms
• A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure
• Global optimization of expensive black box problems with a known lower bound
• Lower bound on complexity of optimization of continuous functions
• Efficient global optimization of expensive black-box functions

Cites work

• A short note on the comparison of interpolation widths, entropy numbers, and Kolmogorov widths
• An information-theoretic analysis of Thompson sampling
• Bayesian algorithms for one-dimensional global optimization
• Capacity of reproducing kernel spaces in learning theory
• CasADi: a software framework for nonlinear optimization and optimal control
• Consistency of sequential Bayesian sampling policies
• Convergence properties of the expected improvement algorithm with fixed mean and covariance functions
• Convergence rates of efficient global optimization algorithms
• Deterministic error bounds for kernel-based learning techniques under bounded noise
• Efficient global optimization of expensive black-box functions
• scientific article; zbMATH DE number 3147888 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 6276119 (Why is no real title available?)
• scientific article; zbMATH DE number 962825 (Why is no real title available?)
• Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
• Metric entropy and approximation
• Minimax-optimal rates for sparse additive models over kernel classes via convex programming
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the mathematical foundations of learning
• Optimal kernel selection in twin support vector machines
• The covering number in learning theory
• The knowledge-gradient algorithm for sequencing experiments in drug discovery
• Tractability of multivariate problems. Volume I: Linear information

This page was built for publication: Lower bounds on the noiseless worst-case complexity of efficient global optimization

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