IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v395y2021ics0096300320308134.html
   My bibliography  Save this article

Efficient computation of the nearest polynomial by linearized alternating direction method

Author

Listed:
  • Hu, Wenyu
  • Zhang, Zichang
  • Tu, Zhihui
  • Huang, Jinhong
  • Zhou, Duanmei

Abstract

Given multiple real polynomials f1,f2,…,fm and a real zero z, we investigate a problem of finding a real polynomial f˜ such that f˜ has z as a zero and the distance between f˜ and f1,f2,…,fm is minimal. By taking the distance as a pair of norms (ℓp,ℓq), the problem can be converted into a linearly constrained convex program via ℓ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 ℓp,q-norm regularized subproblems. Especially for the case of ℓp,∞-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.

Suggested Citation

  • Hu, Wenyu & Zhang, Zichang & Tu, Zhihui & Huang, Jinhong & Zhou, Duanmei, 2021. "Efficient computation of the nearest polynomial by linearized alternating direction method," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    • Handle: RePEc:eee:apmaco:v:395:y:2021:i:c:s0096300320308134
    DOI: 10.1016/j.amc.2020.125860
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320308134
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125860?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:395:y:2021:i:c:s0096300320308134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.