PreprintarXiv licencearXiv
Matrix Nearness Problems Revisited
Abstract
Given a nonempty set of matrices ℰ ⊆ ℂm × n and a matrix A not∈ℰ, a matrix nearness problem (or matrix distance problem) consists in finding a matrix in ℰ that is closest to A, in some norm, as well as the corresponding distance. This article is a survey of matrix nearness problems and of numerical algorithms for their solution. We pay special attention to modern related topics, such as Riemannian optimization and pseudospectra, that were not discussed in depth in previous reviews about this topic. Besides collecting known facts, we also prove some foundational results that, at least in the present form, we could not locate in the literature.
Related
- Matrix nearness problems: Do real inputs admit real solutions?
- Open Problems on the Null Space and Image Space of the Adjacency Matrix
- Solutions to some open problems in matrix analysis
- Quantum lower bounds for convex optimization and real matrix-vector query problems
- Solving Large-Scale Sparse Linear Complementarity Problems Using a Relaxed Shifted Matrix-Splitting Modulus-Based Iteration Method
BibTeX
@misc{noferini2026matrix,
title = {{Matrix Nearness Problems Revisited}},
author = {Vanni Noferini and Federico Poloni},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40313},
eprint = {2610.40313},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40313},
}
RIS
TY - UNPB
TI - Matrix Nearness Problems Revisited
AU - Vanni Noferini
AU - Federico Poloni
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40313
UR - https://arxiv.org/abs/2610.40313
AB - Given a nonempty set of matrices ℰ ⊆ ℂ^m × n and a matrix A not∈ℰ, a matrix nearness problem (or matrix distance problem) consists in finding a matrix in ℰ that is closest to A, in some norm, as well as the corresponding distance. This article is a survey of matrix nearness problems and of numerical algorithms for their solution. We pay special attention to modern related topics, such as Riemannian optimization and pseudospectra, that were not discussed in depth in previous reviews about this topic. Besides collecting known facts, we also prove some foundational results that, at least in the present form, we could not locate in the literature.
ER -