On semidefinite programming characterizations of the numerical radius and its dual norm
DOI10.1137/23m160356xzbMATH Open1545.65174MaRDI QIDQ6592215
Shmuel Friedland, Chi-Kwong Li
Publication date: 24 August 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
semidefinite programminginterior point methodnumerical radiuspolynomial time approximationdual of numerical radiusspectral norm of 3-tensors
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Interior-point methods (90C51) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Numerical range, numerical radius (47A12) Numerical computation of matrix norms, conditioning, scaling (65F35) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- The ellipsoid method and its consequences in combinatorial optimization
- On the complexity of semidefinite programs
- On the complexity of finding tensor ranks
- A Mathematical View of Interior-Point Methods in Convex Optimization
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
- The Computational Complexity of Duality
- Approximation Algorithms and Semidefinite Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Optimal Evaluation of Pairs of Bilinear Forms
- Matrix Completions, Norms, and Hadamard Products
- Nuclear norm of higher-order tensors
- Semidefinite Programming
- Spectral norm of a symmetric tensor and its computation
- Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks
- Most Tensor Problems Are NP-Hard
- Über den Wertevorrat einer Matrix
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
- An experimental comparison of methods for computing the numerical radius
- Rank of a tensor and quantum entanglement
This page was built for publication: On semidefinite programming characterizations of the numerical radius and its dual norm
