Efficient unconstrained black box optimization
From MaRDI portal
Publication:2146451
DOI10.1007/S12532-021-00215-9zbMATH Open1490.90305OpenAlexW4210711696MaRDI QIDQ2146451FDOQ2146451
Morteza Kimiaei, Arnold Neumaier
Publication date: 16 June 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-021-00215-9
Recommendations
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Black-box complexity for bounding the performance of randomized search heuristics
- Black-box search by unbiased variation
- Black-Box Complexity of Local Minimization
- Global optimization of expensive black box problems with a known lower bound
Cites Work
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- A derivative-free algorithm for bound constrained optimization
- UOBYQA: unconstrained optimization by quadratic approximation
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random gradient-free minimization of convex functions
- A particle swarm pattern search method for bound constrained global optimization
- Algorithm 909
- Title not available (Why is that?)
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On the optimal order of worst case complexity of direct search
- A New Active Set Algorithm for Box Constrained Optimization
- Introduction to Derivative-Free Optimization
- Direct Search Based on Probabilistic Descent
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Worst case complexity of direct search under convexity
- Worst case complexity of direct search
- Title not available (Why is that?)
- Benchmarking Derivative-Free Optimization Algorithms
- Convergence of Trust-Region Methods Based on Probabilistic Models
- Global optimization by multilevel coordinate search
- Title not available (Why is that?)
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- GLODS: global and local optimization using direct search
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- A literature survey of benchmark functions for global optimisation problems
- The GLOBAL optimization method revisited
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- A new version of the Price's algorithm for global optimization
- Incorporating minimum Frobenius norm models in direct search
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Developments of NEWUOA for minimization without derivatives
- Optimization by Direct Search in Matrix Computations
- Genetic Algorithms and the Optimal Allocation of Trials
- On efficiently combining limited-memory and trust-region techniques
- A grid algorithm for bound constrained optimization of noisy functions
- A method of trust region type for minimizing noisy functions
- A Note on Using Performance and Data Profiles for Training Algorithms
- Derivative-Free and Blackbox Optimization
- Derivative-free optimization methods
- GOSAC: global optimization with surrogate approximation of constraints
- Stochastic Three Points Method for Unconstrained Smooth Minimization
Cited In (10)
- A new black box method for monotone nonlinear equations
- Hierarchically constrained blackbox optimization
- New subspace method for unconstrained derivative-free optimization
- Learning Enabled Constrained Black-Box Optimization
- Quadratic regularization methods with finite-difference gradient approximations
- Effective matrix adaptation strategy for noisy derivative-free optimization
- Algorithms and Data Structures
- Continuation Newton methods with deflation techniques for global optimization problems
- The ``black-box optimization problem: zero-order accelerated stochastic method via kernel approximation
- Using estimated gradients in bound-constrained global optimization
Uses Software
This page was built for publication: Efficient unconstrained black box optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146451)
