Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling

DOI10.1007/978-3-319-55550-8_3zbMath1385.42026arXiv1609.02233OpenAlexW2518767047MaRDI QIDQ4609724

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

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)

Related Items (2)

Tight Frame Graphs Arising as Line Graphs ⋮ Decomposition of Gaussian processes, and factorization of positive definite kernels

Uses Software

• CVX

Cites Work

• Finite frames. Theory and applications.
• Scalable frames
• Frame scalings: a condition number approach
• Scalable Frames and Convex Geometry
• Measures of Scalability
• Minimizing Condition Number via Convex Programming
• Sampling in Paley-Wiener spaces on combinatorial graphs
• Optimizing Condition Numbers
• Iterative Solution Methods
• The Paulsen Problem in operator theory
• Diagram vectors and tight frame scaling in finite dimensions
• Minimizing Effective Resistance of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling