A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure
From MaRDI portal
Publication:544129
DOI10.1016/J.JCO.2010.10.006zbMath1227.65049OpenAlexW2081828084MaRDI QIDQ544129
Publication date: 14 June 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2010.10.006
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Complexity and performance of numerical algorithms (65Y20)
Cites Work
This page was built for publication: A lower bound on complexity of optimization under the \(r\)-fold integrated Wiener measure