Year: 2020
Type: preprint
Abstract: Optimal matrices for problems involving the matrix numerical radius often have fields of values that are disks, a phenomenon associated with partial smoothness. Such matrices are highly structured: we experiment in particular with the proximal mapping for the radius, which often maps n-by-n random matrix inputs into a particular manifold of disk matrices that has real codimension 2n. The outputs, computed via semidefinite programming, also satisfy an unusual rank property at optimality.
Source: arXiv (Cornell University)
Authors: Han, X. Y., Lewis, Adrian S.
Institution: Cornell University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W3023232184