Spectrally Constrained Optimization

We investigate how to solve smooth matrix optimization problems with general linear inequality constraints on the eigenvalues of a symmetric matrix. We present solution methods to obtain exact global minima for linear objective functions, i.e., F ( X ) = ⟨ C , X ⟩ , and perform exact projections ont...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scientific computing Ročník 100; číslo 3; s. 89
Hlavní autoři: Garner, Casey, Lerman, Gilad, Zhang, Shuzhong
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.09.2024
Springer Nature B.V
Témata:
Algorithms
Computational Mathematics and Numerical Analysis
Constraints
Eigenvalues
First order algorithms
Investigations
Linear functions
Mathematical and Computational Engineering
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Matrices (mathematics)
Optimization
Theoretical
Eigenvalue optimization
68W40
90C52
Non-smooth analysis
65K10
90C26
Frank-Wolfe algorithm
Constrained optimization
Matrix completion
ISSN:0885-7474, 1573-7691
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We investigate how to solve smooth matrix optimization problems with general linear inequality constraints on the eigenvalues of a symmetric matrix. We present solution methods to obtain exact global minima for linear objective functions, i.e., F ( X ) = ⟨ C , X ⟩ , and perform exact projections onto the eigenvalue constraint set. Two first-order algorithms are developed to obtain first-order stationary points for general non-convex objective functions. Both methods are proven to converge sublinearly when the constraint set is convex. Numerical experiments demonstrate the applicability of both the model and the methods.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-7474
1573-7691
DOI:10.1007/s10915-024-02636-9