A unified approach to computing the nearest complex polynomial with a given zero
This paper introduces a new synthetic block-wise norm and proves its dual norm which is very important here. This paper for the first time proposes a unified approach to compute the nearest complex polynomial with a given zero. This paper discusses a matrix-valued optimization problem that is very common in machine learning as an application of the introduced norm.
dual norm nearest polynomial explicit expression lagrange dual problem