搜索资源列表
Archetype-Hull-Ranking
- 我们设计一个新奇的规则化框架以学习相似性度量用于无约束人脸验证。我们形式化它的目标函数通过融合鲁棒性对于大规模的个人人脸的内部变化和新奇的相似性度量的辨别力。额外，我们的形式是一个凸优化问题，保证了全局最优解的存在。-we migrate such a geometric model to address face recognition and verification together through proposing a unified archetype hull rankin
matlab_cvx
- 用于L1范数凸优化的一款matlab工具包，对压缩感知学者有一定帮助。-L1 norm for a convex optimization matlab toolkit, compression perception scholars have some help.
CSDOA
- 凸优化算法实现DOA估计，可以分辨多个目标，估计出目标方位，且有很高的分辨性能。-Convex optimization algorithm to achieve DOA estimation, can distinguish multiple targets, to estimate the direction of the target, and has a high resolution performance.
lmi
- 俞立老师书本例题的仿真程序，凸优化，最优解，可行性等问题。对线性不等式的编程有很好的参考性-Yu Li, teacher simulation of the book program, convex optimization, the optimal solution, feasibility and other issues. The programming of linear inequalities has a good reference
ADMM-method
- ADMM方法对于求解线性约束凸优化问题是有效的。在本文中，我们提出了一个邻近线性算法，同伦算法习惯于求解每个迭代点的子问题。在合适的条件下，这个全局收敛和的收敛速度是所提出算法被证明的最糟糕的情况。一个初始的数值结果表明提出方法的有效性。-ADMM method for solving linear constrained convex optimization problem is effective. In this paper, we propose a near linear algo
maximalPowerPlanningCVX
- 运用凸优化理论，在matlab中采用CVX工具箱进行仿真的最大功率分配算法-the maximal power planning of CVX
examples
- 求解满足约束的稀疏化矩阵，使用L1范数进行凸松弛转化为一个凸优化问题(to solve the sparsity matrix)
Exp_1_2
- 非线性凸优化约束问题 min 10 - x1**2 - x2**2, s.t. x1**2 - x2 <= 0 and x1 + x2 = 0(In this exercise, I use Python-Scipy to solve the following constrained nonlinear optimazation problem: min 10 - x1**2 - x2**2, s.t. x1**2 - x2 <= 0 and x1 + x2 = 0)
线性分类器
- 该程序能够实现对于一个样本完成感知机，最小二乘法，凸优化方法解决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
APGL
- 用于求解凸优化问题，恢复低秩密度矩阵问题(this matlab Algorithm can be used for the convey optimal problen, and also for the low-rank density matrix reconstruction)
cvx
- 凸优化工具，matlab中初始化后可以用来构造转换滤波器。(tool box to design filter)
基于backtracking和0.618的两种梯度下降直线搜索算法
- 本算法为凸优化中的常用优化算法：梯度下降算法。本程序由matlab编写，内含有注释，分别用非精确直线搜索和精确直线搜索两种方法实现了梯度下降算法。
cvx
- 求解最优化问题的matlab 工具 cvx，直接解压后运行 cvx_setup 即可(Matlab tool CVX for solving optimization problems, running cvx_setup after direct decompression)
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.)
凸优化
- this is a good book for convec optimazation
Mutual_Coupling
- 阵列互耦估计，凸优化，均匀线阵解决一维DOA估计问题(Array mutual coupling estimation)
支持向量机( SVM)
- 支持向量机凸优化例子，利用支持向量机算法建立分类模型的例子(An example of support vector machine convex optimization and an example of using support vector machine to establish a classification model)
BP
- 除匹配追踪类贪婪迭代算法之外，压缩感知重构算法另一大类就是凸优化算法或最优化逼近方法，这类方法通过将非凸问题转化为凸问题求解找到信号的逼近，其中最常用的方法就是基追踪(Basis Pursuit, BP)，该方法提出使用l1范数替代l0范数来解决最优化问题，以便使用线性规划方法来求解(In addition to match-tracking greedy iterative algorithms, another major category of compressed-perceptual
Code
- 凸优化教程学习以及Matlab例程使用，里面有各种方法的structure和example(convex optimization learning programs in Matlab, including structure guides and examples of various methods)
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