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
-
Social Norms for Behavior Change: A Synopsis
by: Laura A. Warner, et al.
Published: (2022-01-01) -
First order algorithms for computing linear and polyhedral estimates
by: Bekri, Yannis, et al.
Published: (2024-10-01) -
Essential Norm of the Weighted Composition Operators Between Growth Space
by: Ebrahim Abbasi, et al.
Published: (2025-01-01) -
Validity of legal norms with special reference to Kelsen's general theory of law
by: Pajić-Šavija Sandra
Published: (2023-01-01) -
Robust identification method of website fingerprinting against disturbance
by: ZHANG Jingxi, et al.
Published: (2024-12-01)