Tight computationally efficient approximation of matrix norms with applications
We address the problems of computing operator norms of matrices induced by given norms on the argument and the image space. It is known that aside of a fistful of “solvable cases”, most notably, the case when both given norms are Euclidean, computing operator norm of a matrix is NP-hard. We specify...
Saved in:
Main Authors: | Juditsky, Anatoli, Kotsalis, Georgios, Nemirovski, Arkadi |
---|---|
Format: | Article |
Language: | English |
Published: |
Université de Montpellier
2022-11-01
|
Series: | Open Journal of Mathematical Optimization |
Subjects: | |
Online Access: | https://ojmo.centre-mersenne.org/articles/10.5802/ojmo.19/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
First order algorithms for computing linear and polyhedral estimates
by: Bekri, Yannis, et al.
Published: (2024-10-01) -
Social Norms for Behavior Change: A Synopsis
by: Laura A. Warner, et al.
Published: (2022-01-01) -
A new condition for Root Clustering in PMI regions
by: Mohamed Hechmi BOUAZIZI
Published: (2024-12-01) -
On approximation in the Lp-norm by Hermit interpolation
by: Min Guohua
Published: (1992-01-01) -
Predefined Time Anti-Unwinding Control of Rigid Spacecraft Attitude Tracking
by: Liangmou Hu, et al.
Published: (2025-01-01)