On average complexity of global optimization problems

DOI10.1007/BF01581086zbMath0787.90092OpenAlexW1981070236MaRDI QIDQ687095

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

zbMATH Keywords

global optimizationaverage case complexity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremes and related properties of random sequences and processes
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Complexity of linear programming
• Deterministic and stochastic error bounds in numerical analysis
• Information of varying cardinality
• Approximation and optimization on the Wiener space
• Average case complexity of multivariate integration
• On the Power of Adaptive Information for Functions with Singularities
• Black-Box Complexity of Local Minimization

This page was built for publication: On average complexity of global optimization problems