搜索资源列表
ConjugateGradient
- 共轭梯度法的经典之作,在支持向量机凸规划中经常用到。-Conjugate gradient method of classic convex programming in support vector machines are often used.
Heuristic_Optimization_Methods_in_Econometrics.ra
- A more demanding class of optimization problems stems from general maximum likelihood estimation. As long as the likelihood function can be considered as being globally convex, efficient numerical methods are available to solve the optimization probl
2
- 用C#编写的计算凸包的程序，可以运行，代码简单。-Calculated using C#, the convex hull of the program, you can run the code simple.
3
- 凸包算法的界面化实现，可以计算点集的凸包。-The interface of the convex hull algorithm to achieve, we can calculate the convex hull of point set.
1
- C++编写的凸包运算程序，可以生成平面上点集的凸包。-C++ programs written in the convex hull operation, the plane can generate the convex hull of point set.
4
- C++编写的最小凸包算法，能够生成点集的凸包。-Written in C++ Algorithm for Convex Hull algorithm to generate the convex hull of point set.
tubaoC
- C#编写的凸包算法,计算机图形学中的东西~C#编写-tubao convex hull algorithm Oh good things
tubao
- 算法课程中一个给出N个点和坐标，求取一个凸包的程序-Algorithm for a course coordinates are given N points and strike a convex program
Appliednonlinearprogramming
- A general introduction is provided discussing various industrial/managerial applications. Convex and concave functions are explained for single variaSble and multi-variable examples. As a special case of nonlinear programming, geometric progr
danchunxingfa
- 单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
swiftPP-1.2.tar
- 在原有的swift基础上，实现凸分解，计算非凸物体是否相交的碰撞检测程序。-SWIFT++ operates by first computing a surface decomposition of the input models. The pieces are then grouped hierarchically using convex hulls. A pair of bounding volume hierarchies (BVHs) are tested using an imp
MatlabAlgors
- 陆吾生有关凸优化视频教程中的相应的子函数，包括牛顿法等-convex optimization
FindConvertex
- 计算几何中求散点的凸包，在opengl的环境中开发完成-Scatter in computational geometry convex hull of demand in the developed environment opengl
cvx
- 斯坦福大学Grant和Boyd教授等开发的凸优化matlab最新工具箱(Windows版)-Stanford University Professor Boyd Grant and the development of new convex optimization toolbox matlab (Windows Version)
tubaoliudongjisuan
- 管内含凸包的流动计算,计算在不同Ma数情况下，含凸包矩形内的流动情况-Tube containing the flow of convex hull computation, computing the number of cases in different Ma, convex rectangle with the flow
3DTuBao
- 三维凸包演示，用的是增量法，复试度o(n^2)-Three-dimensional convex hull demo, use the incremental method, the second interview degrees o (n ^ 2)
projekt6
- In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X.
TFOCS_v1.0c_paperExamplesOnly
- 一种新的优化算法，用来解决一系列的凸函数的的优化算法，可应用于图像处理-A new optimization algorithm, to solve a series of convex functions optimization algorithms can be applied to image processing
convex
- Polygon Example made by Some
shiqu
- 绘制任意凸多边形 逝去此凸多边形 对此凸多边形填色-Passing this to draw an arbitrary convex polygon convex polygon convex polygon fill this