✦ LIBER ✦

Some exact iterative procedures for finding the puncture point of a convex set

✍ Scribed by M. C. Spruill

Publisher: Springer
Year: 1980
Tongue: English
Weight: 310 KB
Volume: 31
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00934787

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of finding the convex

On the complexity of finding the convex hull of a set of points

✍ Davis Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 281 KB

An efficient algorithm for finding the m

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

✍ Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Finding the closest point to the origin

Finding the closest point to the origin in the convex hull of a discrete set of points

✍ Hanif D. Sherali; Gyunghyun Choi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 788 KB

An iterative algorithm for finding a nea

An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn

✍ 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

A criterion for the metrizability of a c

A criterion for the metrizability of a compact convex set in terms of the set of extreme points

✍ Brenda MacGibbon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Hybrid Conjugate Gradient Method for a C

Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of

✍ H. Iiduka 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 569 KB