Extreme Point Pursuit – Part II: Further Error Bound Analysis and Applications
arxiv(2024)
摘要
In the first part of this study, a convex-constrained penalized formulation
was studied for a class of constant modulus (CM) problems. In particular, the
error bound techniques were shown to play a vital role in providing exact
penalization results. In this second part of the study, we continue our error
bound analysis for the cases of partial permutation matrices, size-constrained
assignment matrices and non-negative semi-orthogonal matrices. We develop new
error bounds and penalized formulations for these three cases, and the new
formulations possess good structures for building computationally efficient
algorithms. Moreover, we provide numerical results to demonstrate our framework
in a variety of applications such as the densest k-subgraph problem, graph
matching, size-constrained clustering, non-negative orthogonal matrix
factorization and sparse fair principal component analysis.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要