✦ LIBER ✦

Multioptimum of a convex functional

✍ Scribed by D.V Pai

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 920 KB
Volume: 19
Category: Article
ISSN: 0021-9045
DOI: 10.1016/0021-9045(77)90031-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of convex functions

✍ Dinh The Luc; S. Swaminathan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Extremum points of a convex function

✍ J.M. Soriano 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A lower bound for expectation of a conve

A lower bound for expectation of a convex functional

✍ Mei-Hui Guo; Ching-Zong Wei 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A regularization method for a continuous

A regularization method for a continuous convex functional

✍ B.M. Budak; A. Vin'oli; Yu.L. Gaponenko 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 687 KB

Maximizing the ratio of two convex funct

Maximizing the ratio of two convex functions over a convex set

✍ Harold P. Benson 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions __f__ and __g__ over a convex set __X__. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound

Extension of M-Convexity and L-Convexity

Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions

✍ Kazuo Murota; Akiyoshi Shioura 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 454 KB

The concepts of M-convex and L-convex functions were proposed by Murota in 1996 as two mutually conjugate classes of discrete functions over integer lattice points. M/L-convex functions are deeply connected with the well-solvability in nonlinear combinatorial optimization with integer variables. In