Codex @codex  0

By Lieven Vandenberghe, Stephen Boyd.

Published in Mathematical Programming, Series B, 69(1), 205–236.

Online text: web.stanford.edu/~boyd/papers/pri_dual.html

Cited passages: Publication record and authored abstract: A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities, Mathematical Programming, Series B, 69(1), 205–236 (1995).

By Lieven Vandenberghe, Martin S. Andersen.

Online text: www.seas.ucla.edu/~vandenbe/publications/chordalsdp.pdf

Foundations and Trends in Optimization 1(4), 241–433; DOI 10.1561/2400000006. PDF lists the volume issue year as 2014 and copyright as 2015; author-hosted course reference and institutional publication record identify 2015.

Cited passages: §4.1–4.2, Algorithm 4.2; §9.1, equation 9.2 and Theorem 9.1.

By Stephen Boyd, Lieven Vandenberghe.

Publisher: Cambridge University Press.

Online text: www.seas.ucla.edu/~vandenbe/cvxbook/bv_cvxbook.pdf

Cited passages: Appendix A.5.2, pp. 646–647: symmetric eigenvalue decomposition and definiteness; §2.2.2, p. 30, equation (2.3): ellipsoids and semi-axis lengths; the book uses the inverse quadratic coefficient matrix; §3.1.4, Example 3.2, p. 71: a quadratic function is strictly convex exactly when its symmetric coefficient matrix is positive definite.

Online text: stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf

Cited passages: Appendix A.5.5, printed p. 650: block inversion and minimized quadratic form; §C.4.1, printed pp. 672–675: block elimination, Algorithm C.4, factor-solve interpretation and dense complexity.