Chapter 8 Geometric Problems Notes

Stephen Boyd said:

Things like computing projections of a point onto a convex set
Doing things like calculating distance between two convex sets
These are just to simple to even mention.
We are far enough in the class

到现在已经快把凸优化的基础名词概念，各种形式的凸优化问题以及描述问题，并建模为凸优化问题的标准方法介绍完了，实际上下一个章节将开始进入凸优化算法阶段了.

测验下对之前所学的掌握情况:)

How do you compute the distance between two polyhedron.
Without even writing it down, you should konw by now that's just a QP.
This problem should be too simple.

We are far enough in the class. It's time for you to admit things like, there are no intractable convex optimization problems, except that the objective function or the contraint is intractable itself.

The most crucial thing prior to any event like algorithms is to figure out the appropriate representation to make the problem convex.

暂时把vedio中的部分做了粗糙的笔记.
textbook上面的消化后面有时间再补上.