✦ LIBER ✦

On representations of the feasible set in convex optimization

✍ Scribed by Jean Bernard Lasserre

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 108 KB
Volume: 4
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-009-0153-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the lower semicontinuity of optimal s

On the lower semicontinuity of optimal sets in convex parametric optimization

📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 42 KB

Note on prime representations of convex

Note on prime representations of convex polyhedral sets

✍ A. Boneh; R. J. Caron; F. W. Lemire; J. F. McDonald; J. Telgen; T. Vorst 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 258 KB

On the integral representation in convex

On the integral representation in convex noncompact sets of tight measures

✍ Gerhard Winkler 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 French ⚖ 309 KB

Metric regularity of the feasible set ma

Metric regularity of the feasible set mapping in semi-infinite optimization

✍ R. Henrion; D. Klatte 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 358 KB

On Optimal Subset Representations of Int

On Optimal Subset Representations of Integer Sets

✍ Mike Develin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this paper, we investigate representations of sets of integers as subset sums of other sets of minimal size, achieving results on the nature of the representing set as well as providing several reformulations of the problem. We apply one of these reformulations to prove a conjecture and extend a

The complementary unboundedness of dual

The complementary unboundedness of dual feasible solution sets in convex programming

✍ Elmor L. Peterson 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 833 KB