✦ LIBER ✦

An algorithm for finding a vector in the intersection of open convex polyhedral cones

✍ Scribed by Sverre Storøy

Publisher: Springer Netherlands
Year: 1973
Tongue: English
Weight: 220 KB
Volume: 13
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933529

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to decide if the intersecti

An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior

✍ Marcel Boyer; Louis Paquette 📂 Article 📅 1976 🏛 Springer Netherlands 🌐 English ⚖ 202 KB

An algorithm for least squares projectio

An algorithm for least squares projections onto the intersection of translated, convex cones

✍ Richard L. Dykstra; James P. Boyle 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 431 KB

An algorithm for finding the Chebyshev c

An algorithm for finding the Chebyshev center of a convex polyhedron

✍ N. D. Botkin; V. L. Turova-Botkina 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 498 KB

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

An algorithm for determining the minimal

An algorithm for determining the minimal convex subset that contains all the integer points of a convex polyhedral set

✍ J.B. Hughes 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 467 KB

An algorithm for finding the shortest el

An algorithm for finding the shortest element of a polyhedral set with application to lagrangian duality

✍ Mokhtar S Bazaraa; Jamie J Goode; Ronald L Rardin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 453 KB