Generating set search using simplex gradients for bound-constrained black-box optimization

Sander Dedoncker (), Wim Desmet and Frank Naets
Additional contact information
Sander Dedoncker: KU Leuven
Wim Desmet: KU Leuven
Frank Naets: KU Leuven

Computational Optimization and Applications, 2021, vol. 79, issue 1, No 2, 35-65

Abstract: Abstract The optimization problems arising in modern engineering practice are increasingly simulation-based, characterized by extreme types of nonsmoothness, the inaccessibility of derivatives, and high computational expense. While generating set searches (GSS) generally offer a satisfying level of robustness and converge to stationary points, the convergence rates may be slow. In order to accelerate the solution process without sacrificing robustness, we introduce (simplex) gradient-informed generating set search (GIGS) methods for solving bound-constrained minimization problems. These algorithms use simplex gradients, acquired over several iterations, as guidance for adapting the search stencil to the local topography of the objective function. GIGS is shown to inherit first-order convergence properties of GSS and to possess a natural tendency for avoiding saddle points. Numerical experiments are performed on an academic set of smooth, nonsmooth and noisy test problems, as well as a realistic engineering case study. The results demonstrate that including simplex gradient information enables computational cost savings over non-adaptive GSS methods.

Keywords: Derivative-free optimization; Bound-constrained optimization; Generating set search; Simplex derivatives (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-021-00267-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:79:y:2021:i:1:d:10.1007_s10589-021-00267-6

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-021-00267-6

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().