Efficient Computation Of The Nearest Polynomial By Linearized Alternating Direction Method
APPLIED MATHEMATICS AND COMPUTATION(2021)
Abstract
Given multiple real polynomials f(1), f(2), ... , f(m) and areal zero z, we investigate a problem of finding a real polynomial (f) over tilde such that (f) over tilde has z as a zero and the distance between (f) over tilde and f(1), f(2), ... , f(m) is minimal. By taking the distance as a pair of norms (l(p), l(q)), the problem can be converted into a linearly constrained convex program via l(p,q)-norm minimization. We develop an efficient algorithm to compute the nearest polynomial following the framework of linearized alternating direction method (LADM). With adaptive penalty, we analyze the global convergency property of the proposed algorithm under a mild assumption, and also reveal the convergence rate in an ergodic sense by using a simple optimality measure. Moreover, we give detailed discussions to optimal solutions to the l(p,q)-norm regularized subproblems. Especially for the case of l(p,infinity)-norm, we present a projection-based primal-dual method (PPD) to solve the subproblems. Two numerical examples with random and deterministic inputs are provided to validate the effectiveness of the proposed algorithm. (c) 2020 Elsevier Inc. All rights reserved.
MoreTranslated text
Key words
Empirical polynomial, Nearest polynomial, l(p,q) norm, Real zero, Linearized alternating direction method
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined