On Optimal Frame Conditioners
From MaRDI portal
Publication:6258482
arXiv1501.06494MaRDI QIDQ6258482FDOQ6258482
Authors: Chae A. Clark, Kasso A. Okoudjou 
Publication date: 26 January 2015
Abstract: A (unit norm) frame is scalable if its vectors can be rescaled so as to result into a tight frame. Tight frames can be considered optimally conditioned because the condition number of their frame operators is unity. In this paper we reformulate the scalability problem as a convex optimization question. In particular, we present examples of various formulations of the problem along with numerical results obtained by using our methods on randomly generated frames.
Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
This page was built for publication: On Optimal Frame Conditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258482)
