Login / Signup
A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted ℓ2,-norm minimization and its complex extension.
Wenyu Hu
Huiying Huang
Rong Zhang
Jinhong Huang
Yun Yi
Published in:
Theor. Comput. Sci. (2024)
Keyphrases
</>
dynamic programming
np hard
k means
globally optimal
learning algorithm
optimal solution
image processing
objective function
pairwise
nearest neighbor
denoising
high order
convergence rate
convex optimization
computationally intensive