✦ LIBER ✦

Polynomial primal-dual cone affine scaling for semidefinite programming

✍ Scribed by Arjan B. Berkelaar; Jos F. Sturm; Shuzhong Zhang

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 783 KB
Volume: 29
Category: Article
ISSN: 0168-9274
DOI: 10.1016/s0168-9274(98)00100-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric primal-dual path-following alg

Symmetric primal-dual path-following algorithms for semidefinite programming

✍ Jos F. Sturm; Shuzhong Zhang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 667 KB

We propose a framework for developing and analyzing primal-dual interior point algorithms for semidefinite programming. This framework is an extension of the v-space approach that was developed by Kojima et al. (1991) for linear complementarity problems. The extension to semidefinite programming all

A parallel primal–dual interior-point me

A parallel primal–dual interior-point method for semidefinite programs using positive definite matrix completion

✍ Kazuhide Nakata; Makoto Yamashita; Katsuki Fujisawa; Masakazu Kojima 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 266 KB

HOPDM — A higher order primal-dual metho

HOPDM — A higher order primal-dual method for large scale linear programming

✍ Anna Altman; Jacek Gondzio 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 163 KB

QHOPDM — A higher order primal-dual meth

QHOPDM — A higher order primal-dual method for large scale convex quadratic programming

✍ Anna Altman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 187 KB