搜索资源列表
TSP_G
- 利用凸包的原理,求解70个城市的旅行商问题.用Matlab实现-use of convex hull of principle, solving 70 cities in the TSP. Using Matlab
l1magic.tar
- l1-magic的matlab代码，l1-magic: Recovery of Sparse Signals via Convex Programming
TVL1_HCS_v1
- % May 2010 % This matlab code implements TVL1 based Hybrid Compressive Sensing using LSQR. % Only suitable the small scale data due to the costly storage and computation. % % A - M x N measurement matrix: random sampling alone or hybrid sampling (ran
凸优化工具箱CVX
- 斯坦福大学Grant和Boyd教授等开发的凸优化matlab最新工具箱(Windows版)-Stanford University Professor Boyd Grant and the development of new convex optimization toolbox matlab (Windows Version)
cvx
- 讲述凸优化，经典著作，有matlab程序-About convex optimization, classics, there is matlab program
super_resolusion-pocs
- 本代码是用Matlab实现图像的超分辨率重建，方法为凸集投影法，能从多幅低分辨率图像重建一幅高分辨率图像。-We use Matlab to reconstruct image. The method is convex projection on suoer-resolution(POCS).
NonCvxGroupSparsity
- Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central -Non Convex Algorithms for Group Sparse Optimization by Angshul Majumdar @matlab central
ProjectionOnConvexSets
- 重建高分辨率图像使用在凸集投影,高效率matlab程式码-reconstruct high resolution image using Projection On Convex Sets
Desktop
- 数字图像处理中的形态学 matlab凸集裁剪程序-Morphological convex cut
IPM_SampleV1.1
- 使用内点法，解决凸优化问题，此方法(Interior Point Method)是一种求解线性规划或非线性凸优化问题的算法。(The interior point method is used to solve the convex optimization problem. This method (Interior, Point, Method) is an algorithm for solving linear programming or nonlinear convex optimi
未命名文件夹
- matlab convex hull 详细算法(Detailed algorithm for matlab convex hull)
线性分类器
- 该程序能够实现对于一个样本完成感知机，最小二乘法，凸优化方法解决SVM和matlab自带函数解决SVM的四种程序，并且通过修改部分参数可以完成不同效果。(The program can be achieved for a complete sample perceptron, least squares method, convex optimization method to solve SVM and MATLAB with four program function to solve th
GMC_software
- 用于稀疏优化的最新非凸函数GMC算法，可用于信号处理以及图像处理。(The latest non convex function GMC algorithm for sparse optimization, can be used for signal processing and image processing.)
BP神经网络设计程序实例
- 用BP神经网络解决凸优化问题，应用MALAB，取得较好的效果(BP neural network is used to solve convex optimization problems, and MALAB is applied to achieve better results)
fast_sc_r2
- efficient sparse coding, fast feature sign search algorithm, convex optimization
cvx-w64
- 计算凸优化问题的matlab程序包，支持64位系统。来自斯坦福大牛Boyd。(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.)
PSO
- 梯度下降法是最早最简单，也是最为常用的最优化方法。梯度下降法实现简单，当目标函数是凸函数时，梯度下降法的解是全局解。一般情况下，其解不保证是全局最优解，梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向，因为该方向为当前位置的最快下降方向，所以也被称为是”最速下降法“。最速下降法越接近目标值，步长越小，前进越慢。(The gradient descent method is the earliest and most simple and most commo
cvx-w64
- CVX工具箱，64位window matlab，使用。解决凸优化问题(The CVX toolbox, 64 bit window MATLAB, is used. Solving convex optimization problems)
cvx_double_stabel_and_move
- 基于凸优化算法，频率分集阵列天线在全时空域内可控点聚焦，实现对动目标追踪、多目标聚焦，可用于实现点对点秘密通信(Based on convex optimization algorithm, the frequency diversity array antenna can focus on controllable points in the whole time and space domain, and can be used to realize point to point secre