关于凸分析和最优化的经典教材，机器学习重要参考书。

凸优化习题答案【Boyd】

用于求解凸优化问题，是一种迭代收敛算法，将问题转化为凸问题后都可以用椭球法

这是凸优化领域经典教材《convex optimization》教材的课后习题答案。

本资源分为8个单独的PDF文档，囊括了斯坦福大学Boyd教授所开设的凸优化课程（EE364a）的所有课后习题解答。这些习题一部分来自于Boyd所著的凸优化一书，一部分来自于数值优化、机器学习、统计拟合等工程领域，同时配有大量的Matlab实验和代码，可以帮助读者快速入门优化领域。建议读者配合EE364a的公开课一起学习。

this packet codes are about primal dual algorithms for image processing such as image denoising based on ROF model and TV-L1 and Huber ROF, image restoration like deconvolution, image zooming, image inpainting,optical flow for motion estimation and Mumford-Shah multi-label image segmentation problem. these codes are base on the following paper,"a first-order primal-dual algorithm for convex problems with application to imaging", and are organized corresponding to the structure of this paper, therefore these codes are what so-called sample codes of this paper, so they are really convenient to learn and to use. to use them, what you need to do is just to open a folder, and run the corresponding .m file, then you will collect the processing result. to understand these codes,you are recommended to read the paper first, in this case, you can get a better comprehension about these codes. and before you use them, you are also recommended first to read the instructions included in the zip packet,because in all the codes,the primal variables and dual variables are both vectorized which are different from the general situations. if you have any questions about these codes,don't hesitate to contact me via email: Pock, Thomas:pock@icg.tugraz.at Chen, Yunijn:cheny@icg.tugraz.at enjoy them,and good luck with you.

凸优化经典之作，Stephen Boyd所著，可以由浅入深逐步理解凸优化的相关理论知识。本书为英文版，需要一定的英文功底

Bregman算法的原理，非常详尽的解释

凸优化在信号处理和通信中的应用，对于使用凸优化做信号处理和通信的朋友非常有帮助

凸优化matlab算法包内包含多种凸优化算法，可用来解决线性/非线性规划问题，实用性很好。