Generating set search using simplex gradients for bound-constrained black-box optimization
type: Item
instance of: scholarly article
title: Generating set search using simplex gradients for bound-constrained black-box optimization
zbMATH Open document ID: 1469.90136
author: Sander Dedoncker
author: F. Naets
author: Wim Desmet
published in: Computational Optimization and Applications
publication date: 2021-06-01T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/646835
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7353213
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: bound-constrained optimization
zbMATH Keywords: generating set search
zbMATH Keywords: simplex derivatives
describes a project that uses: IMFIL
MaRDI profile type: Publication
OpenAlex ID: W3133573146
Wikidata QID: Q117221005
cites work: Second-Order Behavior of Pattern Search
cites work: Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
cites work: Pattern search in the presence of degenerate linear constraints
cites work: A subclass of generating set search with convergence to second-order stationary points
cites work: A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Derivative-Free and Blackbox Optimization
cites work: Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
cites work: Q4247128
cites work: Fast low-rank modifications of the thin singular value decomposition
cites work: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
cites work: Introduction to Derivative-Free Optimization
cites work: Using simplex gradients of nonsmooth functions in direct search methods
cites work: Incorporating minimum Frobenius norm models in direct search
cites work: Using Sampling and Simplex Derivatives in Pattern Search Methods
cites work: A generating set search method using curvature information
cites work: Q5808749
cites work: An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
cites work: A second-order globally convergent direct-search method and its worst-case complexity
cites work: Q4079017
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
cites work: Implicit Filtering
cites work: Q4435425
cites work: Stationarity Results for Generating Set Search for Linearly Constrained Optimization
cites work: Derivative-free optimization methods
cites work: Implementing Generating Set Search Methods for Linearly Constrained Minimization
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: Objective-derivative-free methods for constrained optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Q5491447
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: On the Convergence of Pattern Search Algorithms
cites work: Fortified-Descent Simplicial Search Method: A General Approach
cites work: Analysis of direct searches for discontinuous functions
DOI: 10.1007/S10589-021-00267-6
description: scientific article; zbMATH DE number 7353213