✦ LIBER ✦

Minimization of a convex maximum function. II

✍ Scribed by V.F. Dem'yanov

Publisher: Elsevier Science
Year: 1971
Weight: 334 KB
Volume: 11
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(71)90146-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convexity of minimal dominating function

Convexity of minimal dominating functions of trees — II

✍ E.J. Cockayne; G. MacGillivray; C.M. Mynhardt 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 580 KB

The relation Ye on the set of minimal dominating functions (MDFs) of a finite graph G is defined by f&?g if and only if any convex combination off and g is also an MDF. If fis a nonintegral MDF of a tree, the existence of another MDF with fewer nonintegral values and other desirable properties is es

Minimization of a convex max-min functio

Minimization of a convex max-min function I

✍ V.F. Dem'yanov 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 742 KB

Minimization of non-linear separable con

Minimization of non-linear separable convex functionals

✍ A. Charnes; C. E. Lemke 📂 Article 📅 1954 🏛 John Wiley and Sons 🌐 English ⚖ 459 KB

The unconditional minimization of non-co

The unconditional minimization of non-convex functions

✍ V.A. Bereznev; V.G. Karmanov; A.A. Tret'yakov 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 286 KB

Convexity of minimal total dominating fu

Convexity of minimal total dominating functions in graphs

✍ Yu, Bo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

A total dominating function (TDF) of a graph G = (V, E) is a function f : V → [0, 1] such that for each v ∈ V , the sum of f values over the open neighbourhood of v is at least one. Zero-one valued TDFs are precisely the characteristic functions of total dominating sets of G. We study the convexity

A multistep stochastic ϵ-subgradient met

A multistep stochastic ϵ-subgradient method of minimizing a convex function

✍ P.A. Dorofeyev 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 277 KB