✦ LIBER ✦

Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity

✍ Scribed by Lasserre, Jean B.

Book ID: 118204732
Publisher: Society for Industrial and Applied Mathematics
Year: 2006
Tongue: English
Weight: 258 KB
Volume: 17
Category: Article
ISSN: 1052-6234
DOI: 10.1137/05064504x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergent Relaxations of Polynomial Opt

Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables

✍ Pironio, S.; Navascués, M.; Acín, A. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 313 KB

Exploiting Sparsity in SDP Relaxations o

Exploiting Sparsity in SDP Relaxations of the OPF Problem

✍ Jabr, R.A. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 94 KB

An exact Jacobian SDP relaxation for pol

An exact Jacobian SDP relaxation for polynomial optimization

✍ Jiawang Nie 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

Sums of Squares and Semidefinite Program

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

✍ Waki, Hayato; Kim, Sunyoung; Kojima, Masakazu; Muramatsu, Masakazu 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 281 KB

Trading Accuracy for Sparsity in Optimiz

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

✍ Shalev-Shwartz, Shai; Srebro, Nathan; Zhang, Tong 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 324 KB

Global optimization of polynomial-expres

Global optimization of polynomial-expressed nonlinear optimal control problems with semidefinite programming relaxation

✍ Takeshi Tsuchiya 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 407 KB