From the strict Chebyshev approximant of a vector to the strict spectral approximant of a matrix

@article{Zietak2017FromTS,
  title={From the strict Chebyshev approximant of a vector to the strict spectral approximant of a matrix},
  author={Krystyna Zietak},
  journal={Banach Center Publications},
  year={2017},
  volume={112},
  pages={307-346}
}
  • K. Zietak
  • Published 2017
  • Mathematics
  • Banach Center Publications
The main aim of this review paper is approximation of a complex rectangular matrix, with respect to the unitarily invariant norms, by matrices from a linear subspace or from a convex closed subset of matrices. In particular, we focus on the properties and characterizations of the strict spectral approximant which is the best in some sense among all approximants to a given matrix with respect to the spectral norm. We formulate a conjecture that the strict spectral approximant to a matrix by… 
3 Citations

Subdifferential of the joint numerical radius

Characterizations of subdifferentials of matrix norms has been of interest to many mathematicians. Let Mn(C) be the set of n × n matrices over C. For A ∈ Mn(C), let s1(A) ≥ · · · ≥ sn(A) be the

A distance formula for tuples of operators

References

SHOWING 1-10 OF 104 REFERENCES

Strict Approximation of Matrices

5 Corollary 2. A matrix B 2 M is the strict spectral approximation of C if and only if the vector (B ?C) is minimal with respect to the ordinary lexicographic ordering in the set f : = (B ? C); B 2

Approximation by matrices with restricted spectra

COMPUTING A NEAREST SYMMETRIC POSITIVE SEMIDEFINITE MATRIX

On Best Approximations of Polynomials in Matrices in the Matrix 2-Norm

We show that certain matrix approximation problems in the matrix 2-norm have uniquely defined solutions, despite the lack of strict convexity of the matrix 2-norm. The problems we consider are

On matrix approximation problems with Ky Fank norms

  • G. Watson
  • Mathematics, Computer Science
    Numerical Algorithms
  • 2005
TLDR
A characterization of the subdifferential of the matrix norm is considered for a class of orthogonally invariant norms known as Ky Fank norms, which include as special cases the spectral norm and the trace norm, and this leads to a consideration of efficient algorithms.

A canonical trace class approximant

Let H be a finite-dimensional Hilbert space, B( H) the space of bounded linear operators on H, and C a convex subset of B( H). If A is a fixed operator in B( H), then A has a unique best approximant

Approximations in $L^p $ and Chebyshev Approximations

TLDR
It is shown that the strict approximation is the limit of the best approximation in LP when p -* oo, and one cannot generalize this result for functions defined on an infinite set.

STRICT SPECTRAL APPROXIMATION OF A MATRIX AND SOME RELATED PROBLEMS

We show how the strict spectral approximation can be used to obtain characterizations and properties of solutions of some problems in the linear space of matrices. Namely, we deal with (i)

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with

Optimization in Function Spaces: With Stability Considerations in Orlicz Spaces

This is an essentially self-contained book on the theory of convex functions and convex optimization in Banach spaces, with a special interest in Orlicz spaces. Approximate algorithms based on the
...