- 博客(1)
- 资源 (25)
- 收藏
- 关注
原创 匈牙利算法
匈牙利算法(Hungarian Algorithm):用于求解二分图的最大匹配问题 一些定义: 二分图:把一个图的顶点划分为两个不相交集 U 和V ,使得每一条边都分别连接U、V中的顶点,且U或V中顶点没有边相连接。如果存在这样的划分,则此图为一个二分图。二分图的一个等价定义是:不含有「含奇数条边的环」的图。 匹配:在图论中,一个「匹配」(matching)是匹配边的集合,其中任意两
2018-03-17 23:47:51 460 2
Convex Optimization
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.
2016-09-02
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人