✦ LIBER ✦

A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron

✍ Scribed by Manuel J. Carrillo

Publisher: Springer-Verlag
Year: 1977
Tongue: English
Weight: 626 KB
Volume: 13
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01584324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithm for maximizing a linear functi

Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

✍ Nguen Ngok Tyu 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 491 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

On the section of a convex polyhedron

✍ Peter Frankl; Hiroshi Maehara; Junichiro Nakashima 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P. For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths o

A minimization method for the sum of a c

A minimization method for the sum of a convex function and a continuously differentiable function

✍ H. Mine; M. Fukushima 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 671 KB

Essentially finite algorithms for minimi

Essentially finite algorithms for minimizing a class of convex piecewise polynomial functions

✍ M. D. Troutt 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 551 KB

A note on the maximum of quasiconcave fu

A note on the maximum of quasiconcave functions

✍ D. Netzer; U. Passy 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 225 KB