Efficient algorithms for solving the p-Laplacian in polynomial time.

Sébastien Loisel

Published in: Numerische Mathematik (2020)

Keyphrases

efficient algorithms for solving
least squares
lower bound
canonical correlation analysis
computational complexity
special case
worst case
edge detection
approximation algorithms
data sets
unsupervised learning
sparse coding