A Chebyshev Set and its Distance Function
โ Scribed by Zili Wu
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 140 KB
- Volume
- 119
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
โฆ Synopsis
We prove that in a Banach space X with rotund dual X n a Chebyshev set C is convex iff the distance function d C is regular on X =C iff d C admits the strict and G# a ateaux derivatives on X =C which are determined by the subdifferential @jjx ร %
x xjj for each x 2 X =C and %
x x 2 P C รฐxร :ยผ fc 2 C : jjx ร cjj ยผ d C รฐxรg: If X is a reflexive Banach space with smooth and Kadec norm then C is convex iff it is weakly closed iff P C is continuous. If the norms of X and X n are Fr! e echet differentiable then C is convex iff d C is Fr! e echet differentiable on X =C: If also X has a uniformly G# a ateaux differentiable norm then C is convex iff the G# a ateaux (Fr! e echet) subdifferential @ ร d C รฐxร (@ F d C รฐxร) is nonempty on X =C: # 2002 Elsevier Science (USA)
๐ SIMILAR VOLUMES
## Abstract The difference between a presumed distribution of flamelet position and a numerically simulated distribution of distance function (a signed distance to flamelet) is investigated. It is shown that even if the distribution of flamelet position is symmetrical and close to Gaussian, the dis
Undesirable outputs are often produced together with desirable outputs. This joint production of good and bad outputs is typically ignored in traditional measures of productivity since "prices" are typically unavailable for bad outputs. Here we introduce a directional distance function and use it as
## Abstract Subโcellโfix reโinitialization method was proposed by Russo and Smereka (__J. Comput. Phys.__ 2000; **163**: 51โ67) as a modification to the reโdistancing algorithm of Sussman __et al__. (__J. Comput. Phys.__ 1994; **114**: 146โ159) that determines the distance function from an interfac