.png){kind=icon}
返回
Two Fast Complex-Valued Algorithms for Solving Complex Quadratic Programming Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2015.2490170.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose two fast complex-valued optimization algorithms for solving complex quadratic programming problems: 1) with linear equality constraints and 2) with both an l(1)-norm constraint and linear equality constraints. By using Brandwood's analytic theory, we prove the convergence of the two proposed algorithms under mild assumptions. The two proposed algorithms significantly generalize the existing complex-valued optimization algorithms for solving complex quadratic programming problems with an l(1)-norm constraint only and unconstrained complex quadratic programming problems, respectively. Numerical simulations are presented to show that the two proposed algorithms have a faster speed than conventional real-valued optimization algorithms.
Keyword:
Brandwood's analytic
complex quadratic programming
complex-valued algorithm
fast convergence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.7W
机构
引用论文
.png){kind=icon}
On the use of the atomic force microscope to monitor physical degradation of polymeric coating surfaces关于使用原子力显微镜监测聚合物涂层表面的物理降解
PREAI
分享收藏Nonlinearly Activated Neural Network for Solving Time-Varying Complex Sylvester Equation求解时变复Sylvester方程的非线性激活神经网络
PREAI
分享收藏
查看更多内容