Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

The worst-case behaviour of a general class of regularization algorithms is considered in the case where only objective function values and associated gradient vectors are evaluated. Upper bounds are derived on the number of such evaluations that are needed for the algorithm to produce an approximat...

全面介紹

書目詳細資料
Main Authors: Cartis, C, Gould, N, Toint, P
格式: Journal article
出版: Taylor and Francis 2017

相似書籍