Abstract
We make an experimental comparison of methods for computing the numerical radius of an n×n complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a convex optimization problem in n2+1 real variables. We make comparisons with respect to both accuracy and computation time using publicly available software.
Original language | English (US) |
---|---|
Article number | 100434 |
Journal | Results in Applied Mathematics |
Volume | 21 |
DOIs | |
State | Published - Feb 2024 |
Keywords
- Convex optimization
- Field of values
- Nonconvex optimization
- Numerical range
- Semidefinite programming
ASJC Scopus subject areas
- Applied Mathematics