Efficient unconstrained black box optimization
From MaRDI portal
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
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 50672 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A New Active Set Algorithm for Box Constrained Optimization
- A derivative-free algorithm for bound constrained optimization
- A grid algorithm for bound constrained optimization of noisy functions
- A literature survey of benchmark functions for global optimisation problems
- A method of trust region type for minimizing noisy functions
- A new version of the Price's algorithm for global optimization
- A note on using performance and data profiles for training algorithms
- A particle swarm pattern search method for bound constrained global optimization
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Convergence of trust-region methods based on probabilistic models
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Developments of NEWUOA for minimization without derivatives
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Direct search based on probabilistic descent
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- GLODS: global and local optimization using direct search
- GOSAC: global optimization with surrogate approximation of constraints
- Genetic Algorithms and the Optimal Allocation of Trials
- Global optimization by multilevel coordinate search
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Incorporating minimum Frobenius norm models in direct search
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- On efficiently combining limited-memory and trust-region techniques
- On the optimal order of worst case complexity of direct search
- Optimization by Direct Search in Matrix Computations
- Random gradient-free minimization of convex functions
- Stochastic three points method for unconstrained smooth minimization
- The GLOBAL optimization method revisited
- UOBYQA: unconstrained optimization by quadratic approximation
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Worst case complexity of direct search
- Worst case complexity of direct search under convexity
Cited in
(14)- Damage location in mechanical structures by multi-objective pattern search
- A new black box method for monotone nonlinear equations
- Hierarchically constrained blackbox optimization
- A subspace inertial method for derivative-free nonlinear monotone equations
- New subspace method for unconstrained derivative-free optimization
- Learning Enabled Constrained Black-Box Optimization
- Quadratic regularization methods with finite-difference gradient approximations
- An improved randomized algorithm with noise level tuning for large-scale noisy unconstrained DFO problems
- 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
- MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization
Describes a project that uses
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)
