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

DOI10.1007/s10589-021-00267-6zbMath1469.90136OpenAlexW3133573146WikidataQ117221005 ScholiaQ117221005MaRDI QIDQ2028453

Sander Dedoncker, Frank Naets, Wim Desmet

Publication date: 1 June 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/646835

zbMATH Keywords

derivative-free optimizationbound-constrained optimizationgenerating set searchsimplex derivatives

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (1)

An adaptive direct multisearch method for black-box multi-objective optimization

Uses Software

• IMFIL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of direct searches for discontinuous functions
• Incorporating minimum Frobenius norm models in direct search
• Objective-derivative-free methods for constrained optimization
• Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
• Fast low-rank modifications of the thin singular value decomposition
• A generating set search method using curvature information
• A second-order globally convergent direct-search method and its worst-case complexity
• A subclass of generating set search with convergence to second-order stationary points
• On the Convergence of Pattern Search Algorithms
• Implicit Filtering
• Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
• Using Sampling and Simplex Derivatives in Pattern Search Methods
• Pattern search in the presence of degenerate linear constraints
• Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
• Using simplex gradients of nonsmooth functions in direct search methods
• Implementing Generating Set Search Methods for Linearly Constrained Minimization
• Introduction to Derivative-Free Optimization
• `` Direct Search Solution of Numerical and Statistical Problems
• On the Convergence of the Multidirectional Search Algorithm
• Analysis of Generalized Pattern Searches
• Pattern Search Methods for Linearly Constrained Minimization
• Derivative-Free and Blackbox Optimization
• Pattern Search Algorithms for Bound Constrained Minimization
• Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
• An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
• Fortified-Descent Simplicial Search Method: A General Approach
• A Survey on Direct Search Methods for Blackbox Optimization and Their Applications
• Benchmarking Derivative-Free Optimization Algorithms
• Derivative-free optimization methods
• Stationarity Results for Generating Set Search for Linearly Constrained Optimization
• Second-Order Behavior of Pattern Search
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization

This page was built for publication: Generating set search using simplex gradients for bound-constrained black-box optimization