IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v76y2020i3d10.1007_s10589-020-00182-2.html
   My bibliography  Save this article

Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification

Author

Listed:
  • M. A. Diniz-Ehrhardt

    (University of Campinas)

  • D. G. Ferreira

    (University of Campinas)

  • S. A. Santos

    (University of Campinas)

Abstract

Our contribution in this paper is twofold. First, the global convergence analysis of the recently proposed pattern search implicit filtering algorithm (PSIFA), aimed at linearly constrained noisy minimization problems, is revisited to address more general locally Lipschitz objective functions corrupted by noise. Second, PSIFA is applied for solving the damped harmonic oscillator parameter identification problem. This problem can be formulated as a linearly constrained optimization problem, for which the constraints are related to the features of the damping. Such a formulation rests upon a very expensive objective function whose evaluation comprises the numerical solution of an ordinary differential equation (ODE), with intrinsic numerical noise. Computational experimentation encompasses distinct choices for the ODE solvers, and a comparative analysis of the most effective options against the pattern search and the implicit filtering algorithms.

Suggested Citation

  • M. A. Diniz-Ehrhardt & D. G. Ferreira & S. A. Santos, 2020. "Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification," Computational Optimization and Applications, Springer, vol. 76(3), pages 835-866, July.
    • Handle: RePEc:spr:coopap:v:76:y:2020:i:3:d:10.1007_s10589-020-00182-2
    DOI: 10.1007/s10589-020-00182-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00182-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-020-00182-2?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ernesto G. Birgin, 2020. "Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization," Computational Optimization and Applications, Springer, vol. 76(3), pages 615-619, July.

    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:spr:coopap:v:76:y:2020:i:3:d:10.1007_s10589-020-00182-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.