搜索资源列表
mali
- 蛮力法的程序实现源代码，可以实质性的解决凸包问题，有运行界面--Convex hull problem ~ mfc based on the implementation. Rough interface, the implementation of the major functions of ~
ConvexHull
- 使用C++实现的基于OpenGl的Graham扫描法求解二维凸包问题-Using c++ implementation based on OpenGl Graham scan method to solve the two dimensional convex hull problem
NLPforCQSDP
- 二次半定规划的非线性规划算法源代码，比内点算法快很多。-Based on the change of , an augmented lagrangian algorithm to solve convex quadratic SDP is proposed. The algorithm’s distinguishing feature is a factorization, the gradient method and an exact linesearch procedure. The c
SolveOMP
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
main2
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
main
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点convex optimization algorithm with high complexity-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings
SolveBP
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
domp
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
voronoi
- Voronoi Diagram算法实现主要运用分治法和凸包的方法来实现。 分治法： 1) 该问题的规模缩小到一定的程度就可以容易地解决 2) 该问题可以分解为若干个规模较小的相同问题，即该问题具有最优子结构性质。 3) 利用该问题分解出的子问题的解可以合并为该问题的解； 4) 该问题所分解出的各个子问题是相互独立的，即子问题之间不包含公共的子问题。 -Voronoi Diagram algorithm is mainly using the method of pa
cvx-w32
- CVX-一款在matlab中，用于解决计算包括凸优化等问题，支持线性优化和二次方优化以及半正定算法。-CVX is a modeling system for constructing and solving disciplined convex programs (DCPs). CVX supports a number of standard problem types, including linear and quadratic programs (LPs/QPs), second-
color-constancy
- A system for disciplined convex programming Copyright (C) 2005-2012 Michael C. Grant and Stephen P. Boyd. This program is free software you can redistribute it and/or modify it under the terms of the GNU General Public License as published-A system
cvx-zuiquan
- 关于凸优化资料，目前最新版本的matlab图优化工具加载方法和学习算例。里面讲述了多目标优化、内点法等一些凸优化具体算例，希望对大家有用。-About convex optimization data, the latest version of the loading method matlab figure optimization tools and learning examples. Which describes a multi-objective optimization, int
MVDR
- Rubust beamforming with convex optimization
L1_homotopy
- li mininimization convex optimization
NLPforCQSDP
- 将二次半定规划转化为非线性规划,利用增广拉格朗日算法求解。-solve convex quadratic SDP
cvx-w64
- convex programming CVX is a Matlab-based modeling system for convex optimization. CVX turns Matlab into a modeling language, allowing constraints and objectives to be specified using standard Matlab expression syntax.
cvx
- MATLAB工具箱函数，适合于凸优化计算，CVX，使用简单，应用广泛-MATLAB toolbox function, suitable for convex optimization, CVX, easy to use, widely used
cvx-w64
- 斯坦福大学开发的凸优化包，适用于matlab环境，解决凸优化问题-Stanford University developed convex optimization package for matlab environment, solving convex optimization problem
Apples-occlusion-method-
- 为实现受果树枝叶遮挡、果实间相互遮挡的果实目标识别，该文提出了一种基于凸壳理论的遮挡苹果目 标识别方法。-To achieve obscured by the foliage of fruit trees, fruit fruit mutual occlusion between target identification, the paper proposes blocking Apple target recognition method based on convex hull the
cvx
- 该工具包是用来计算MIMO中的凸优化问题，工具包用在matlab中可用来简化计算-The kit is used to calculate the MIMO convex optimization problem in matlab toolkit used to simplify the calculation of available