包邮凸优化应用讲义-英文

1  preliminary knowledge
  1.1  nomenclatures
  1.2  convex sets and convex functions
  1.3  convex optimization
    1.3.1  gradient descent and coordinate descent
    1.3.2  karush-kuhn-tucker (kkt) conditions
  1.4  some lemmas in linear algebra
  1.5  a brief introduction of cvx toolbox
  problems
  references
2  support vector machines
  2.1  basic svm
  2.2  soft margin svm
  2.3  kernel svm
  2.4  multi-kernel svm
  2.5  multi-class svm
  2.6  decomposition and smo
  2.7  further discussions
  problems
  references
3  parameter estimations
  3.1  maximum likelihood estimation
  3.2  measurements with iid noise
  3.3  expectation maximization for mixture models
  3.4  the general expectation maximization
  3.5  expectation maximization for ppca model with missing data
  3.6  k-means clustering
  problems
  references
4  norm approximation and regularization
  4.1  norm approximation
  4.2  tikhonov regularization
  4.3  1-norm regularization for sparsity
  4.4  regularization and map estimation
  problems
  references
5  semidefinite programming and linear matrix inequalities
  5.1  semidefinite matrix and semidefinite programming
  5.2  lmi and classical linear control problems
    5.2.1  stability of continuous-time linear systems
    5.2.2  stability of discrete-time linear systems..'
    5.2.3  lmi and algebraic riccati equations
  5.3  lmi and linear systems with time delay
  problems
  references
6  convex relaxation
  6.1  basic idea of convex relaxation
  6.2  max-cut problem
  6.3  solving sudoku puzzle
  problems
  references
7  geometric problems
  7.1  distances
  7.2  sizes
  7.3  intersection and containment
  problems
  references
index