Monografie
Optimal algorithms for global optimization in case of unknown Lipschitz constant
- Language
-
Englisch
- Identifier
-
987595660
- Series
-
Dagstuhl seminar proceedings 04401
Contributor
Horn, Matthias
- URN
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
26.01.2023, 1:54 PM CET
Object type
- Monografie
Associated
- Horn, Matthias
Other Objects (12)
Algorithms and complexity for continuous problems : Dagstuhl seminar ; 04401 abstracts collection
Optimal approximation of elliptic problems by linear and nonlinear mappings
Polynomial time algorithms for multivariate linear problems with finite order weights : worst case setting
Summary of the Dagstuhl seminar 04401 (26.09. - 01.10.2004) "Algorithms and complexity for continuous problems"
On the complexity of parabolic initial value problems with variable drift
Functional quantization and metric entropy for Riemann-Liouville processes
Upper error bounds for approximations of stochastic differential equations with markovian switching
Computing multi-homogeneous Bézout numbers is hard
Information based nonlinear approximation : an average case setting
Fast component-by-component construction for (non-)primes
Quantization of self-similar probabilities
Numerical approximation of parabolic stochastic partial differential equations
Algorithms and complexity for continuous problems : Dagstuhl seminar ; 04401 abstracts collection
Optimal approximation of elliptic problems by linear and nonlinear mappings
Polynomial time algorithms for multivariate linear problems with finite order weights : worst case setting
Summary of the Dagstuhl seminar 04401 (26.09. - 01.10.2004) "Algorithms and complexity for continuous problems"
On the complexity of parabolic initial value problems with variable drift
Functional quantization and metric entropy for Riemann-Liouville processes
Upper error bounds for approximations of stochastic differential equations with markovian switching
Computing multi-homogeneous Bézout numbers is hard
Information based nonlinear approximation : an average case setting
Fast component-by-component construction for (non-)primes
Quantization of self-similar probabilities
Numerical approximation of parabolic stochastic partial differential equations
Algorithms and complexity for continuous problems : Dagstuhl seminar ; 04401 abstracts collection
Optimal approximation of elliptic problems by linear and nonlinear mappings
Polynomial time algorithms for multivariate linear problems with finite order weights : worst case setting
Summary of the Dagstuhl seminar 04401 (26.09. - 01.10.2004) "Algorithms and complexity for continuous problems"
On the complexity of parabolic initial value problems with variable drift
Functional quantization and metric entropy for Riemann-Liouville processes
Upper error bounds for approximations of stochastic differential equations with markovian switching
Computing multi-homogeneous Bézout numbers is hard
Information based nonlinear approximation : an average case setting
Fast component-by-component construction for (non-)primes
Quantization of self-similar probabilities