A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions

被引:7
作者
Diniz-Ehrhardt, M. A. [1 ]
Ferreira, D. G. [1 ]
Santos, S. A. [1 ]
机构
[1] Univ Estadual Campinas, Inst Math, Campinas, SP, Brazil
基金
巴西圣保罗研究基金会;
关键词
Derivative-free optimization; linearly constrained minimization; noisy optimization; global convergence; degenerate constraints; numerical experiments; GENERATING SET SEARCH; OPTIMIZATION; CONVERGENCE;
D O I
10.1080/10556788.2018.1464570
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
PSIFA - Pattern Search and Implicit Filtering Algorithm - is a derivative-free algorithm that has been designed for linearly constrained problems with noise in the objective function. It combines some elements of the pattern search approach of Lewis and Torczon with ideas from the method of implicit filtering of Kelley enhanced with a further analysis of the current face and a simple extrapolation strategy for updating the step length. The feasible set is explored by PSIFA without any particular assumption about its description, being the equality constraints handled in their original formulation. Besides, compact bounds for the variables are not mandatory. The global convergence analysis is presented, encompassing the degenerate case, under mild assumptions. Numerical experiments with linearly constrained problems from the literature were performed. Additionally, problems with the feasible set defined by polyhedral 3D cones with several degrees of degeneration at the solution were addressed, including noisy functions that are not covered by the theoretical hypotheses. To put PSIFA in perspective, comparative tests have been prepared, with encouraging results.
引用
收藏
页码:827 / 852
页数:26
相关论文
共 32 条
  • [1] Pattern search in the presence of degenerate linear constraints
    Abramson, Mark A.
    Brezhneva, Olga A.
    Dennis, J. E., Jr.
    Pingeld, Rachael L.
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2008, 23 (03) : 297 - 319
  • [2] On the resolution of the generalized nonlinear complementarity problem
    Andreani, R
    Friedlander, A
    Santos, SA
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2001, 12 (02) : 303 - 321
  • [3] [Anonymous], 1999, NONLINEAR PROGRAMMIN
  • [4] [Anonymous], 2013, THESIS
  • [5] Analysis of generalized pattern searches
    Audet, C
    Dennis, JE
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2003, 13 (03) : 889 - 903
  • [6] A PROGRESSIVE BARRIER FOR DERIVATIVE-FREE NONLINEAR PROGRAMMING
    Audet, Charles
    Dennis, J. E., Jr.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2009, 20 (01) : 445 - 472
  • [7] Conn A.., 2009, Introduction to Derivative-Free Optimization
  • [8] Using simplex gradients of nonsmooth functions in direct search methods
    Custodio, A. L.
    Dennis, J. E. Jr
    Vicente, L. N.
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 2008, 28 (04) : 770 - 784
  • [9] Using sampling and simplex derivatives in pattern search methods
    Custodio, A. L.
    Vicente, L. N.
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2007, 18 (02) : 537 - 555
  • [10] Incorporating minimum Frobenius norm models in direct search
    Custodio, A. L.
    Rocha, H.
    Vicente, L. N.
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 46 (02) : 265 - 278