REVIEW 1 cited by
Variational analysis of spectral functions simplified
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their subdifferentials to the subdifferentials of their diagonal restrictions. This paper presents a new, short, and revealing derivation of this result. We then round off the paper with an illuminating derivation of the second derivative of twice differentiable spectral functions, highlighting the underlying geometry. All of our arguments have direct analogues for spectral functions of Hermitian matrices, and for singular value functions of rectangular matrices.
Forward citations
Cited by 1 Pith paper
-
Strong Formulations and Algorithms for Regularized A-optimal Design
Regularized A-optimal design is NP-hard, and a new convex relaxation dominates previous ones with finite optimality gaps for every k, enabling faster exact and greedy solvers.
Discussion (0). Continue with ORCID to comment.