框架调节的最优化方法及其在图拉普拉斯尺度变换中的应用
Optimization methods for frame conditioning and application to graph Laplacian scaling
摘要:
一个帧是可伸缩的,如果它的每个向量可以以这样一种方式重新缩放,使得结果集成为一个Parseval帧。在本文中,我们考虑四个不同的最优化问题,以确定一个帧是可伸缩的。我们提供了一些算法来解决这些问题。然后,我们应用和扩展我们的方法的问题,重新加权(有限)图,以尽量减少所产生的拉普拉斯算子的条件数。
英文摘要:
A frame is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some algorithms to solve these problems. We then apply and extend our methods to the problem of reweighing (finite) graph so as to minimize the condition number of the resulting Laplacian.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。