A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
β Scribed by Kazuyuki Sekitani; Yoshitsugu Yamamoto
- Publisher
- Springer-Verlag
- Year
- 1993
- Tongue
- English
- Weight
- 807 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a
In this paper the existence of a point of coincidence and a common fixed point for two weakly compatible maps on a cone metric space has been established. The two mappings are assumed to satisfy certain weak inequalities. Supporting examples are also given.
We have applied single-strand conformation polymorphism (SSCP) to the analysis of exon 7 of the anticoagulant protein C (PC) gene, in 13 PC-deficient Spanish families. Abnormal patterns were visualized in three samples from type I or quantitative PC deficient proposita. A previously undescribed muta