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

Sébastien Loisel

Published in: CoRR (2020)

Keyphrases

efficient algorithms for solving
least squares
lower bound
special case
canonical correlation analysis
computational complexity
worst case
edge detection
approximation algorithms
optimal solution
model selection
zero crossing
graph laplacian