搜索资源列表
thssYimingSub
- 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
Convex Optimization算法优化
- Stephen Boyd Department of Electrical Engineering Stanford University Lieven Vandenberghe Electrical Engineering Department University of California, Los Angeles
DFT5486135412
- 过采样近似完全重构 DFT 调制滤波器组的设计。首先,分析了传递函数和 混叠传递函数的性质，给出了因果 FIR DFT 调制滤波器组的系统延迟与线性相位 分析和综合原型滤波器阶数的关系。随后，过采样近似完全重构 DFT 调制滤波器 组的设计问题被描述为一个非凸优化问题。-Near perfect reconstruction oversampled DFT modulated filter design. First, the analysis of the transfer fun
thesisOFDMA-RessourceAllocation
- 一篇同学的硕士论文 --OFDMA Ressource Allocation using Multiuser Constant-Power Waterfilling. 关于OFDMA 资源分配的算法 用到凸优化(convex optimization)的理论 证明对多用户的Waterfilling算法可以实现优化原则-A master
k_cvdcs_extabstr_cg96
- Calculating Voronoi Diagrams using Convex Sweep Curves
MESH-on-the-minimum-for-a-convex-body-surrounded.r
- 关于求一个MESH的最小凸包围体 所谓凸体， 就是从凸体内任意一点，向周围发射线，都只此MESH相交一次。-MESH on the minimum for a convex body surrounded the so-called convex body, convex body from any point, to launch around the line, only this time MESH intersection.
lmibook
- Linear matrix inequality, convex optimization
StephenBoydconvexoptimization
- Boyd s Convex Optimization textbook. Classic
360compkill
- The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The
tubao
- 凸包算法及实现,供学习和参考使用，-Convex hull algorithm and implementation
Convex-Optimization-Sol-Manual
- Solution Manual of Convex Optimization by Stephen Boyd
Convex-Cost-Functions-in-blind-equalization
- Convex Cost Functions in blind equalization
Solution-to-Convex-Optimization-By-S.Boyd-L.Vande
- Solution to Convex Optimization By S.Boyd L.Vandenberghe
CONVEX-HULL-OF-A-SIMPLE-POLYLINE
- 一种快速计算图形凸包的算法，算法比较简单，实现起来也很容易，有兴趣的可以参阅一下。-A fast algorithm to calculate the graphics convex hull algorithm is relatively simple, and is also very easy to implement, are interested can see what.
Convex-Optimization
- 凸优化；Convex Optimization - Stephen Boyd + Lieven Vandenberghe-Convex Optimization- Stephen Boyd+ Lieven Vandenberghe
Convex-hull
- 根据基于生成凸包的算法，编写一个自动生成凸包的程序- According to the convex hull based algorithm to generate, write a program to automatically generate the convex hull
Convex-Discriminative
- 考虑多任务聚类试图以他们的同时提高多任务的聚类性能关系。大多数现有的多任务聚类算法陷入生成聚类的类型，并没有被转化为凸优化问题。本文提出了两个凸的判别任务聚类（DMTC）目的地址的问题。-Multitask clustering tries to improve the clustering performance of multiple tasks simultaneously by taking their relationship into account. Most existing m
Convex-hull-algorithm
- 凸包算法。寻找最少的点包围点云，可以用来绘制色空间的色域。-Convex hull algorithm. The least points will be founed surround all the point cloud, which coule be used to draw the color gamut for color space.
Convex-Optimization
- stephen Boyd凸优化理论 英文原件pdf-convex optimization pdf
Convex Optimization 习题及题解
- Additional Exercises for Convex Optimization Stephen Boyd Lieven Vandenberghe March 18, 2016 凸优化课后习题答案，包含17章共623页