✦ LIBER ✦

Polynomial time solvability of non-symmetric semidefinite programming

✍ Scribed by Sheng-Long Hu; Zheng-Hai Huang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The polynomial solvability of convex qua

✍ M.K. Kozlov; S.P. Tarasov; L.G. Khachiyan 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 336 KB

Symmetricity of the solution of semidefi

✍ Y. Kanno; M. Ohsaki; N. Katoh 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 743 KB

A Unified Class of Directly Solvable Sem

✍ Masakazu Muramatsu 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 105 KB

Structured semidefinite programs for the

✍ Randy Cogill; Sanjay Lall; Pablo A. Parrilo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Reduction of symmetric semidefinite prog

✍ Etienne de Klerk; Dmitrii V. Pasechnik; Alexander Schrijver 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

Polynomiality of an inexact infeasible i

✍ Guanglu Zhou; Kim-Chuan Toh 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 211 KB