讲述了凸集、凸函数、凸优化对偶等基础理论，还有凸优化算法的应用以及带约束以及不带约束的优化问题

L1-MAGIC is a collection of MATLAB routines for solving the convex optimization programs central to compressive sampling. The algorithms are based on standard interior-point methods, and are suitable for large-scale problems.

凸壳算法 在 Rust 中实现，带有可视化工具。用于更好地了解 Rust、cgmath 和 glium 的玩具项目。

凸优化 使用cvx工具箱的SDP用于传感器网络本地化 在论文[2]中，公式（34）中的方程M_ik矩阵可能不正确。 e_k项应为负。 成本函数是随机选择的，可能不合适

一本写给工程师看的凸优化书籍。作者本身是这方面的大牛！

convex optimization中文版和相关资料 Stephen Boyd, Stanford University, California, Lieven Vandenberghe, University of California, Los Angeles Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems.

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.

凸优化 非线性优化 convex optimization nonlinear programming

convhull_3d：Quickhull算法的仅标头C实现，用于构建3-D凸包

凸优化英文版，高清，带书签，学习凸优化的经典教材，特别推荐！