期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 52, 期 3, 页码 391-409出版社
SPRINGER
DOI: 10.1007/s10898-011-9747-5
关键词
Convex envelope; Global optimization; Factorable programming; Submodular functions
资金
- National Science Foundation [CMII-1030168]
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [1030168] Funding Source: National Science Foundation
In this paper, we consider functions of the form phi(x, y) = f (x)g(y) over a box, where f (x), x is an element of R-n is a nonnegative monotone convex function with a power or an exponential form, and g(y), y is an element of R-n is a component-wise concave function which changes sign over the vertices of its domain. We derive closed-form expressions for convex envelopes of various functions in this category. We demonstrate via numerical examples that the proposed envelopes are significantly tighter than popular factorable programming relaxations.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据