Eigenvalue programming beyond matrices

Masaru Ito () and Bruno F. Lourenço ()
Additional contact information
Masaru Ito: Nihon University
Bruno F. Lourenço: Institute of Statistical Mathematics

Computational Optimization and Applications, 2024, vol. 89, issue 2, No 3, 384 pages

Abstract: Abstract In this paper we analyze and solve eigenvalue programs, which consist of the task of minimizing a function subject to constraints on the “eigenvalues” of the decision variable. Here, by making use of the FTvN systems framework introduced by Gowda, we interpret “eigenvalues” in a broad fashion going beyond the usual eigenvalues of matrices. This allows us to shed new light on classical problems such as inverse eigenvalue problems and also leads to new applications. In particular, after analyzing and developing a simple projected gradient algorithm for general eigenvalue programs, we show that eigenvalue programs can be used to express what we call vanishing quadratic constraints. A vanishing quadratic constraint requires that a given system of convex quadratic inequalities be satisfied and at least a certain number of those inequalities must be tight. As a particular case, this includes the problem of finding a point x in the intersection of m ellipsoids in such a way that x is also in the boundary of at least $$\ell $$ ℓ of the ellipsoids, for some fixed $$\ell > 0$$ ℓ > 0 . At the end, we also present some numerical experiments.

Keywords: Eigenvalue programming; Eigenvalue optimization; FTvN systems; Vanishing quadratic constraints (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-024-00591-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:89:y:2024:i:2:d:10.1007_s10589-024-00591-7

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-024-00591-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().