A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.48, Iss.1, 2010-09, pp. : 17-27

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the convergence rates of genetic algorithms

By He J. Kang L.

Theoretical Computer Science, Vol. 229, Iss. 1, 1999-11 ,pp. : 23-39

Elsevier

Access to resources Recommend Favorite

A Rigorous Lower Bound for the Optimal Value of Convex Optimization Problems

By Jansson Christian

Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. : 121-137

Springer Publishing Company

Access to resources Recommend Favorite

Global optimization of expensive black box problems with a known lower bound

By Cassioli Andrea Schoen Fabio

Journal of Global Optimization, Vol. 57, Iss. 1, 2013-09 ,pp. : 177-190

Springer Publishing Company

Access to resources Recommend Favorite

NEURAL NETWORKS AND OPTIMIZATION ALGORITHMS APPLIED FOR CONSTRUCTION OF LOW NOISE TREAD PROFILES

By Becker Matthias Szczerbicka Helena Thomas Michael

Cybernetics and Systems, Vol. 38, Iss. 5-6, 2007-06 ,pp. : 535-548

Taylor & Francis Ltd

Access to resources Recommend Favorite

Developing Interval Global Optimization Algorithms on the Basis of Branch-and-Bound and Constraint Propagation Methods

By Dolgov Yuri

Reliable Computing, Vol. 11, Iss. 5, 2005-10 ,pp. : 343-358

Springer Publishing Company

Access to resources Recommend Favorite