𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Semidefinite programming for min–max problems and games

✍ Scribed by R. Laraki; J. B. Lasserre

Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
310 KB
Volume
131
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving min-max problems and linear semi
Solving min-max problems and linear semi-infinite programs
✍ S.-C. Fang; Soon-Yi Wu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 309 KB

For a min-max problem in the form of minxEx maxtET {A(X)}, the nondi\_fferentiability of the max function F(x) --maxtET {ft(x)} presents special difficulty in finding optimal solutions. We show that an entropic regularization procedure can provide a smooth approximation Fp(x) that uniformly converge

Complexity of the min–max and min–max re
Complexity of the min–max and min–max regret assignment problems
✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro

Approximation Algorithms for MAX 4-SAT a
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
✍ Eran Halperin; Uri Zwick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Karloff and Zwick obtained recently an optimal 7r8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7r8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semidefinit