Optimization methods for frame conditioning and application to graph Laplacian scaling

DOI10.1007/978-3-319-55550-8_3MaRDI QIDQ4609724zbMATH OpenOpenAlexFDO

Authors Radu Balan, Matthew J. Begué, Chae Clark, Kasso A. Okoudjou

Publication date 26 March 2018

Published in Frames and Other Bases in Abstract and Function Spaces (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.02233

Mathematics Subject Classification ID

General harmonic expansions, frames (42C15)

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.

Recommendations

• Frame scalings: a condition number approach
• Scalable frames
• Preconditioning techniques in frame theory and probabilistic frames
• scientific article; zbMATH DE number 7112232
• Minimal scalings and structural properties of scalable frames

Cites work

• Diagram vectors and tight frame scaling in finite dimensions
• Finite frames. Theory and applications.
• Frame scalings: a condition number approach
• scientific article; zbMATH DE number 47363 (Why is no real title available?)
• scientific article; zbMATH DE number 3533576 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 6026126 (Why is no real title available?)
• Iterative Solution Methods
• Measures of Scalability
• Minimizing Condition Number via Convex Programming
• Minimizing Effective Resistance of a Graph
• Optimizing condition numbers
• Quasiconvex programming
• Sampling in Paley-Wiener spaces on combinatorial graphs
• Scalable frames
• Scalable frames and convex geometry
• The Paulsen problem in operator theory

Cited in

(6)

• The cycle time vector of D-A-D functions
• Frame scalings: a condition number approach
• Tight frame graphs arising as line graphs
• Decomposition of Gaussian processes, and factorization of positive definite kernels
• Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM
• Scaling Laplacian pyramids

Describes a project that uses

Uses Software

• CVX

This page was built for publication: Optimization methods for frame conditioning and application to graph Laplacian scaling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609724)