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

被引:2
|
作者
Diniz-Ehrhardt, M. A. [1 ]
Ferreira, D. G. [1 ]
Santos, S. A. [1 ]
机构
[1] Univ Estadual Campinas, Inst Math, Rua Sergio Buarque de Holanda 651, BR-13083859 Campinas, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Derivative-free optimization; Linearly constrained minimization; Pattern search; Implicit filtering; Global convergence; Noisy optimization; OPTIMIZATION;
D O I
10.1007/s10589-020-00182-2
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:835 / 866
页数:32
相关论文
共 50 条
  • [31] Solving Bi-Objective Quadratic Assignment Problem with Squirrel Search Algorithm
    Ningtiyas, Sri Wahyuni
    Pratiwi, Asri Bekti
    Damayanti, Auli
    INTERNATIONAL CONFERENCE ON MATHEMATICS, COMPUTATIONAL SCIENCES AND STATISTICS 2020, 2021, 2329
  • [32] Large scale parallel Iterated Local Search algorithm for solving Traveling Salesman Problem
    Rocki, Kamil
    Suda, Reiji
    HIGH PERFORMANCE COMPUTING SYMPOSIUM 2012 (HPC 2012), 2012, 44 (06): : 26 - 33
  • [33] Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
    Wang, Zhaocai
    Liang, Kun
    Bao, Xiaoguang
    Wu, Tunhua
    QUANTUM INFORMATION PROCESSING, 2023, 22 (07)
  • [34] A Novel Approach Based on Crow Search Algorithm for Solving Reactive Power Dispatch Problem
    Meddeb, Asma
    Amor, Nesrine
    Abbes, Mohamed
    Chebbi, Souad
    ENERGIES, 2018, 11 (12)
  • [35] Solving the Integrated Optimal Power and Gas Flow Problem by Improved Crow Search Algorithm
    Mohammadi, Farid
    Abdi, Hamdi
    ELECTRIC POWER SYSTEMS RESEARCH, 2022, 211
  • [36] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
    Wu, Haizhou
    Zhou, Yongquan
    Luo, Qifang
    INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 23 - 53
  • [37] Solving a Realistic Location Area Problem Using SUMATRA Networks with the Scatter Search Algorithm
    Almeida-Luz, Sonia M.
    Vega-Rodriguez, Miguel A.
    Gomez-Pulido, Juan A.
    Sanchez-Perez, Juan M.
    2009 9TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2009, : 689 - +
  • [38] SOLVING THE RING ARC-LOADING PROBLEM USING A HYBRID SCATTER SEARCH ALGORITHM
    Moreira Bernardino, Anabela
    Moreira Bernardino, Eugenia
    Manuel Sanchez-Perez, Juan
    Antonio Gomez-Pulido, Juan
    Angel Vega-Rodriguez, Miguel
    ICEC 2010: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION, 2010, : 60 - 69
  • [39] Solving k-Barrier Coverage Problem Using Modified Gravitational Search Algorithm
    Zhang, Yanhua
    Sun, Xingming
    Yu, Zhanke
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
  • [40] Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem
    Razavi, Seyedeh Fatemeh
    Sajedi, Hedieh
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2015, 29 (05) : 2247 - 2258