<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
Large-scale and global maximization of the distance to instability

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

KU-Authors

Organization Authors

Co-Authors

Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

The larger the distance to instability from a matrix is, the more robustly stable the associated autonomous dynamical system is in the presence of uncertainties and typically the less severe transient behavior its solution exhibits. Motivated by these issues, we consider the maximization of the distance to instability of a matrix dependent on several parameters, a nonconvex optimization problem that is likely to be nonsmooth. In the first part we propose a globally convergent algorithm when the matrix is of small size and depends on a few parameters. In the second part we deal with the problems involving large matrices. We tailor a subspace framework that reduces the size of the matrix drastically. The strength of the tailored subspace framework is proven with a global convergence result as the subspaces grow and a superlinear rate-of-convergence result with respect to the subspace dimension.

Source

Publisher

Society for Industrial and Applied Mathematics (SIAM)

Citation

item.page.haspartof

Source

SIAM Journal on Matrix Analysis and Applications

item.page.ispartofseries

item.page.edition

DOI

10.1137/18M1177019

item.page.datauri

item.page.link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators