Lower bounds on the noiseless worst-case complexity of efficient global optimization
From MaRDI portal
Publication:6536837
DOI10.1007/s10957-024-02399-1zbMATH Open1546.90199MaRDI QIDQ6536837
Colin N. Jones, Y. Jiang, Wenjie Xu, Emilio Tanowe Maddalena
Publication date: 14 May 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short note on the comparison of interpolation widths, entropy numbers, and Kolmogorov widths
- Tractability of multivariate problems. Volume I: Linear information
- Convergence properties of the expected improvement algorithm with fixed mean and covariance functions
- Optimal kernel selection in twin support vector machines
- Efficient global optimization of expensive black-box functions
- Bayesian algorithms for one-dimensional global optimization
- CasADi: a software framework for nonlinear optimization and optimal control
- The covering number in learning theory
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Deterministic error bounds for kernel-based learning techniques under bounded noise
- On the mathematical foundations of learning
- The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery
- Consistency of Sequential Bayesian Sampling Policies
- Capacity of reproducing kernel spaces in learning theory
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Convergence rates of efficient global optimization algorithms
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- Metric entropy and approximation
This page was built for publication: Lower bounds on the noiseless worst-case complexity of efficient global optimization
