tailieunhanh - Lecture Convex optimization - Chapter: Numerical linear algebra background

Lecture Convex optimization - Chapter: Numerical linear algebra background. This chapter presents the following content: Matrix structure and algorithm complexity; solving linear equations with factored matrices; LU, Cholesky, LDLT factorization; block elimination and the matrix inversion lemma; solving underdetermined equations. |