On average complexity of global optimization problems
From MaRDI portal
Publication:687095
DOI10.1007/BF01581086zbMATH Open0787.90092OpenAlexW1981070236MaRDI QIDQ687095FDOQ687095
Authors: Grzegorz W. Wasilkowski 
Publication date: 6 January 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581086
Recommendations
Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Extremes and related properties of random sequences and processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic and stochastic error bounds in numerical analysis
- Title not available (Why is that?)
- Approximation and optimization on the Wiener space
- Average case complexity of multivariate integration
- Information of varying cardinality
- On the Power of Adaptive Information for Functions with Singularities
- Black-Box Complexity of Local Minimization
- Approximation of linear functionals on a Banach space with a Gaussian measure
- Complexity of linear programming
- Title not available (Why is that?)
Cited In (7)
- On the asymptotic tractability of global optimization
- A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure
- Average case \(L_\infty\)-approximation in the presence of Gaussian noise
- Uniform reconstruction of Gaussian processes
- Hyperbolic cross designs for approximation of random fields
- Title not available (Why is that?)
- On complexity of a global optimization problem
This page was built for publication: On average complexity of global optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687095)
