Publication:
A support function based algorithm for optimization with eigenvalue constraints

Placeholder

Organizational Units

Program

School College Institute

College of Sciences

KU-Authors

KU Authors

Co-Authors

N/A

Advisor

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

item.page.alternative

Abstract

Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalue functions and is of practical interest because of a wide range of applications in fields such as structural design and control theory. Here we focus on the optimization of a linear objective subject to a constraint on the smallest eigenvalue of an analytic and Hermitian matrix-valued function. We propose a numerical approach based on quadratic support functions that overestimate the smallest eigenvalue function globally. the quadratic support functions are derived by employing variational properties of the smallest eigenvalue function over a set of Hermitian matrices. We establish the local convergence of the algorithm under mild assumptions and deduce a precise rate of convergence result by viewing the algorithm as a fixed point iteration. the convergence analysis reveals that the algorithm is immune to the nonsmooth nature of the smallest eigenvalue. We illustrate the practical applicability of the algorithm on the pseudospectral functions.

Source:

Publisher:

Siam Publications

Subject

Mathematics, Applied mathematics

Citation

Has Part

Source:

Siam Journal on Optimization

Book Series Title

Edition

DOI

10.1137/140966551

item.page.datauri

Link

Rights

Rights URL (CC Link)

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

2

Views

0

Downloads

View PlumX Details