- 博客(1)
- 资源 (25)
- 收藏
- 关注
RSS订阅原创 Dijksta算法原理
Dijkstra算法（迪杰斯特拉算法）：搜索从某一顶点出发到其他各点的最短距离 。在写上面这句话时，我反复确认了Dijksta拼写是否正确，虽然很早就接触过这个算法，但一直没拼对过这个算法的名字。下文结合实例介绍该算法的原理。1.算法描述1)算法思想：设G=(V,E)是一个带权有向图，把图中顶点集合V分成两组，第一组为已求出最短路径的顶点集合（用S表示，初始时S中只有一个源点，以后
2017-06-10 17:56:22
1615
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关注的人