On average complexity of global optimization problems

DOI10.1007/BF01581086MaRDI QIDQ687095zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

global optimizationaverage case complexity

Mathematics Subject Classification ID

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

Recommendations

• Average case optimality
• On the asymptotic tractability of global optimization
• Average-case analysis of numerical problems
• Average-case non-approximability of optimisation problems
• scientific article; zbMATH DE number 757674

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3751955 (Why is no real title available?)
• scientific article; zbMATH DE number 43985 (Why is no real title available?)
• scientific article; zbMATH DE number 45848 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• scientific article; zbMATH DE number 193848 (Why is no real title available?)
• scientific article; zbMATH DE number 3456359 (Why is no real title available?)
• scientific article; zbMATH DE number 3245885 (Why is no real title available?)
• Approximation and optimization on the Wiener space
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Average case complexity of multivariate integration
• Black-Box Complexity of Local Minimization
• Complexity of linear programming
• Deterministic and stochastic error bounds in numerical analysis
• Extremes and related properties of random sequences and processes
• Information of varying cardinality
• On the Power of Adaptive Information for Functions with Singularities

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_-approximation in the presence of Gaussian noise
• Uniform reconstruction of Gaussian processes
• Hyperbolic cross designs for approximation of random fields
• scientific article; zbMATH DE number 5233906 (Why is no real title available?)
• 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)