✦ LIBER ✦

Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program

✍ Scribed by Locatelli, Marco

Book ID: 121766118
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 200 KB
Volume: 41
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2013.04.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximization of the Ratio of Two Convex

Maximization of the Ratio of Two Convex Quadratic Functions over a Polytope

✍ Jun-Ya Gotoh; Hiroshi Konno 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 117 KB

An explicit characterization of the conv

An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes

✍ Hanif D. Sherali; Amine Alameddine 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 590 KB

Concise RLT forms of binary programs: A

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

✍ Richard J. Forrester; Warren P. Adams; Paul T. Hadavas 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restriction

Construction of the characteristic funct

Construction of the characteristic function of a non-convex set and the related problem of quadratic integer-valued programming

✍ A.I. Samylovskii; V.G. Sushkov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 973 KB

A practicable way for computing the dire

A practicable way for computing the directional derivative of the optimal value function in convex programming

✍ Baumgart, R.; Beer, K. 📂 Article 📅 1992 🏛 Taylor and Francis Group 🌐 English ⚖ 434 KB