research

Lower bound on complexity of optimization of continuous functions

Abstract

AbstractThis paper considers the problem of approximating the minimum of a continuous function using a fixed number of sequentially selected function evaluations. A lower bound on the complexity is established by analyzing the average case for the Brownian bridge

Similar works

Full text

thumbnail-image

Elsevier - Publisher Connector

Provided a free PDF
Last time updated on 4/28/2017View original full text link

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.