✦ LIBER ✦

Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions

✍ Scribed by Monteiro, Renato D. C.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial Convergence of a New Family o

✍ Monteiro, Renato D. C.; Tsuchiya, Takashi 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 470 KB

Polynomial convergence of primal-dual al

✍ Renato D.C. Monteiro; Takashi Tsuchiya 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Polynomiality of primal-dual algorithms

✍ Renato D.C. Monteiro; Takashi Tsuchiya 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 137 KB

Superlinear Convergence of a Symmetric P

✍ Luo, Zhi-Quan; Sturm, Jos F.; Zhang, Shuzhong 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 344 KB

New Complexity Analysis of the Primal–Du

✍ J. PENG; C. ROOS; T. TERLAKY 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 100 KB

Polynomial-time algorithms for linear pr

✍ Robert M. Freund 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 826 KB