We study the problem of optimal recovery in the case of a nonsymmetric
convex class of functions. In particular we show that adaptive method
s may be much better than nonadaptive methods. We define certain Gelfa
nd-type widths that are useful for nonsymmetric classes and prove rela
tions to optimal error bounds for adaptive and nonadaptive methods, re
spectively. (C) 1995 Academic Press, Inc.