๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Adaption Problem for Nonsymmetric Convex Sets

โœ Scribed by E. Novak

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
329 KB
Volume
82
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

โœฆ Synopsis

We study the problem of optimal recovery in the case of a nonsymmetric convex class of functions. We compare adaptive and nonadaptive methods and prove a bound on how much better adaptive methods can be. We use new inequalities between Gelfand widths and Bernstein widths and new relations between these widths and optimal error bounds for adaptive and nonadaptive methods, respectively. 1995 Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

The Length Problem for Co-R.E. Sets
The Length Problem for Co-R.E. Sets
โœ Martin Kummer ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 306 KB

Let Fin be the set of finite functions defined on initial segments of o), The length problem is stated as follows: "Characterize the sets L E cc) which satisfy R, u Fin@) r.e." [9]. It growed out of the work of W. MENZEL and V. SPERSCHNEIDER on r.e. extensions of R, by finite functions [a], [9J If

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
โœ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

An adaptive finite element procedure for
An adaptive finite element procedure for the image segmentation problem
โœ Yaacobson, Fiana S. ;Givoli, Dan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 215 KB ๐Ÿ‘ 1 views

The image segmentation problem in computer vision is considered. Given a two-dimensional domain D and a function deยฎned on it (the original image), the problem is to obtain a `cartoon' associated with this function, namely to ยฎnd a set of inner boundaries which divide D into subdomains (objects) in

Cover inequalities for robust knapsack s
Cover inequalities for robust knapsack setsโ€”Application to the robust bandwidth packing problem
โœ Olivier Klopfenstein; Dritan Nace ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 226 KB

## Abstract The robust optimization framework proposed by Bertsimas and Sim accounts for data uncertainty in integer linear programs. This article investigates the polyhedral impacts of this robust model for the 0โ€1 knapsack problem. In particular, classical cover cuts are adapted to provide valid