Algorithms for Convex Optimization

1.3 Fast and exact algorithms via interior point methods 12 1.4 Ellipsoid method beyond succinct linear programs 13 2 Preliminaries 17 2.1 Derivatives, gradients, and Hessians 17 2.2 Fundamental theorem of calculus 19 2.3 Taylor approximation 19 2.4 Linear algebra, matrices, and eigenvalues 20 2.5 The Cauchy-Schwarz inequality 23 2.6 Norms 23 ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download