𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


An iterative algorithm for finding a nea
✍ B. Llanas; M. Fernandez de Sevilla; V. Feliu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 536 KB

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

The point of coincidence and common fixe
✍ Binayak S. Choudhury; N. Metiya πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 319 KB

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.

Protein C deficiency: Identification of
✍ JosΓ© Manuel Soria; Jordi Fontcuberta; Montserrat Borrell; Xavier Estivill; NΓΊria πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 337 KB

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