✦ LIBER ✦

Geometric method of search for a common point of convex sets

✍ Scribed by M. B. Shchepakin

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 257 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01075110

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method to find a point of a convex set

✍ R. F. Khabibullin 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 421 KB

Geometric permutations of disjoint trans

Geometric permutations of disjoint translates of convex sets

✍ M. Katchalski; T. Lewis; A. Liu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 565 KB

The object of this paper is to study how many essentially different common transversals a family of convex sets on the plane can have. In particular we consider the case where the family consists of pairwise disjoint translates of a single convex set.

The relaxation method of finding the com

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

✍ L.M. Bregman 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 824 KB

Inequalities for probability contents of

Inequalities for probability contents of convex sets via geometric average

✍ Moshe Shaked; Y.L Tong 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Finding the common point of a system of

Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method

✍ M. B. Shchepakin 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 441 KB

The santalo point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)