Pages that link to "Item:Q1888381"
From MaRDI portal
The following pages link to Lower bound on complexity of optimization of continuous functions (Q1888381):
Displaying 10 items.
- Optimization of the temple lower bound (Q427463) (← links)
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure (Q544129) (← links)
- One-dimensional global optimization for observations with noise (Q814080) (← links)
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise (Q1959254) (← links)
- Adaptive quantile computation for Brownian bridge in change-point analysis (Q2072415) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- A lower bound on complexity of optimization on the Wiener space (Q2383590) (← links)
- Optimal algorithms for global optimization in case of unknown Lipschitz constant (Q2489149) (← links)
- On the minimum of a conditioned Brownian bridge (Q4646606) (← links)
- Complexity of general continuous minimization problems: a survey (Q5717540) (← links)