Chebyshev Polynomials and Best Rank-one Approximation Ratio.

Andrei A. Agrachev Khazhgali Kozhasov André Uschmajew

Published in: SIAM J. Matrix Anal. Appl. (2020)

Keyphrases

approximation ratio
approximation algorithms
np hard
special case
greedy algorithm
search algorithm
approximately optimal
minimum cost
krawtchouk moments
worst case
highly ranked
lower bound
computational complexity
approximation guarantees
computer vision
chaotic sequence
information retrieval