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 time.
標簽： optimization employs optical network
上傳時間： 2015-12-27
上傳用戶：dongbaobao
【書名】 Convex Optimization 【作者】Stephen Boyd Lieven Vandenberghe 最優(yōu)化理論與算法是一個重要的數(shù)學(xué)分支，它所研究的問題是在眾多的方案中什么樣的方案最優(yōu)以及怎樣找出最優(yōu)方案。 本書詳細的介紹了凸優(yōu)化的理論，應(yīng)用和算法，是一本在解決最優(yōu)化問題時很好的工具書。
標簽： Optimization Vandenberghe Stephen Convex
上傳時間： 2016-11-09
上傳用戶：xiaodu1124
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: Recursively construct Convex hulls for SL and SR. Denote these Convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a Convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標簽： contains Output Convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
Convex Optimization book. A useful and fundamental tool for all domain [image processing, network,...]
標簽： Optimization fundamental processing network
上傳時間： 2014-01-24
上傳用戶：wlcaption
Calculating Voronoi Diagrams using Convex Sweep Curves
標簽： Calculating Diagrams Voronoi Convex
上傳時間： 2017-04-07
上傳用戶：685
Convex constructed uisng Matlab
標簽： constructed Convex Matlab uisng
上傳時間： 2014-09-10
上傳用戶：waizhang
Graham Convex hull sofware
標簽： sofware Graham Convex hull
上傳時間： 2013-12-24
上傳用戶：3到15
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 wrap as tight as it can. The resultant polygon is a Convex hull.
上傳時間： 2013-12-23
上傳用戶：it男一枚
Convex algorithm bodo
上傳時間： 2013-12-12
上傳用戶：1101055045
Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central
標簽： Optimization Algorithms Majumdar Angshul
上傳時間： 2017-06-03
上傳用戶：youth25
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
