搜索结果

找到约 16 项符合 Convex 的查询结果

系统设计方案 This my phd thesis for the WDM optical network optimization, which employs convex optimization techn

This my phd thesis for the WDM optical network optimization, which employs convex optimization techniques to solve the proposed integer problems. The computation complexity of my optimization framework is very low compared with other existing method and a performance bound is provided at the same ti ...
https://www.eeworm.com/dl/678/238950.html
下载: 61
查看: 1039

其他书籍 【书名】 Convex Optimization 【作者】Stephen Boyd Lieven Vandenberghe 最优化理论与算法是一个重要的数学分支

【书名】 Convex Optimization 【作者】Stephen Boyd Lieven Vandenberghe 最优化理论与算法是一个重要的数学分支,它所研究的问题是在众多的方案中什么样的方案最优以及怎样找出最优方案。 本书详细的介绍了凸优化的理论,应用和算法,是一本在解决最优化问题时很好的工具书。 ...
https://www.eeworm.com/dl/542/364488.html
下载: 190
查看: 1270

其他 Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than f

Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursi ...
https://www.eeworm.com/dl/534/406520.html
下载: 85
查看: 1049

其他书籍 Convex Optimization book. A useful and fundamental tool for all domain [image processing, network,..

Convex Optimization book. A useful and fundamental tool for all domain [image processing, network,...]
https://www.eeworm.com/dl/542/417469.html
下载: 57
查看: 1072

软件设计/软件工程 Calculating Voronoi Diagrams using Convex Sweep Curves

Calculating Voronoi Diagrams using Convex Sweep Curves
https://www.eeworm.com/dl/684/424573.html
下载: 65
查看: 1025

数学计算 Convex constructed uisng Matlab

Convex constructed uisng Matlab
https://www.eeworm.com/dl/641/428697.html
下载: 58
查看: 1024

数学计算 Graham convex hull sofware

Graham convex hull sofware
https://www.eeworm.com/dl/641/428698.html
下载: 80
查看: 1030

数学计算 A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is

A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wr ...
https://www.eeworm.com/dl/641/429860.html
下载: 112
查看: 1077

数学计算 convex algorithm bodo

convex algorithm bodo
https://www.eeworm.com/dl/641/443508.html
下载: 170
查看: 1013

matlab例程 Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central

Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central
https://www.eeworm.com/dl/665/448050.html
下载: 152
查看: 1040