返回
Successive Projection Method for Well-Conditioned Matrix Approximation Problems
DOI:10.1109/LSP.2014.2303153.png)
摘要
En 中文
Matrices are often required to be well-conditioned in a wide variety of areas including signal processing. Problems to find the nearest positive definite matrix or the nearest correlation matrix that simultaneously satisfy the condition number constraint and sign constraints are presented in this paper. Both problems can be regarded as those to find a projection to the intersection of the closed convex cone corresponding to the condition number constraint and the convex polyhedron corresponding to the other constraints. Thus, we can apply a successive projection method, which is a classical algorithm for finding the projection to the intersection of multiple convex sets, to these problems. The numerical results demonstrated that the algorithm effectively solved the problems.
Keyword:
Covariance matrices
estimation
iterative algorithms
least squares approximations
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
T-786C Polymorphism in Promoter of eNOS Gene as Genetic Risk Factor in Patients With Erectile Dysfunction in Turkish Population
Urology
IF0
Compression and Air Storage Systems for Small Size CAES Plants: Design and Off-design Analysis小型CAES工厂的压缩和空气存储系统: 设计和非设计分析
Side-Chain Liquid Crystal Co-Polymers for Angular Photochromic Anti-Counterfeiting Powder and Fiber
Crystals
IF0

