arXiv · 1609.02233
Optimization methods for frame conditioning and application to graph Laplacian scaling
Abstract
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.
Explore related subjects
Keep this discovery
Radu Balan, Mathew Begué, Chae Clark, Kasso A. Okoudjou. 2016-09-08. Optimization methods for frame conditioning and application to graph Laplacian scaling. https://arxiv.org/abs/1609.02233
Cite the original work for its findings. Save a collection to share your selection of sources.