Benchmarking Derivative-Free Optimization Algorithms
From MaRDI portal
Recommendations
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Derivative-Free Optimization
- Derivative-free optimization methods
- Derivative-free and blackbox optimization
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- A derivative-free algorithm for unconstrained optimization
- Survey of derivative-free optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
Cited in
(only showing first 100 items - show all)- An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems
- Globally-biased disimpl algorithm for expensive global optimization
- Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization
- Benchmarking deterministic optimization algorithms using an outranking approach
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- Model-based derivative-free methods for convex-constrained optimization
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- On the implementation of a global optimization method for mixed-variable problems
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- A note on performance profiles for benchmarking software
- A common framework for modified regula falsi methods and new methods of this kind
- Survey of derivative-free optimization
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization
- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Binary, unrelaxable and hidden constraints in blackbox optimization
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique
- Escaping local minima with local derivative-free methods: a numerical investigation
- Incorporating minimum Frobenius norm models in direct search
- MISO: mixed-integer surrogate optimization framework
- The optimization test environment
- A subclass of generating set search with convergence to second-order stationary points
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- A derivative-free comirror algorithm for convex optimization
- Multistart algorithm for identifying all optima of nonconvex stochastic functions
- Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
- Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods
- A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property
- Benchmarking optimization software -- a (Hi)story
- Derivative-free methods for mixed-integer constrained optimization problems
- A surrogate management framework using rigorous trust-region steps
- A derivative-free method using a new underdetermined quadratic interpolation model
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Benchmarking nonlinear optimization software in technical computing environments
- Performance of a coordinate search ANN training algorithm
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- Global solutions to nonconvex problems by evolution of Hamilton-Jacobi PDEs
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- A container loading problem MILP-based heuristics solved by CPLEX: an experimental analysis
- A subset-selection-based derivative-free optimization algorithm for dynamic operation optimization in a steel-making process
- A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions
- Derivative-free optimization for population dynamic models
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Exploiting Problem Structure in Derivative Free Optimization
- An interior proximal gradient method for nonconvex optimization
- An initialization strategy for high-dimensional surrogate-based expensive black-box optimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A method for constrained multiobjective optimization based on SQP techniques
- Computing of high breakdown regression estimators without sorting on graphics processing units
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Model construction for convex-constrained derivative-free optimization
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- A Derivative-Free Method for Structured Optimization Problems
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems
- Performance indicators in multiobjective optimization
- A new black box method for monotone nonlinear equations
- Scalable subspace methods for derivative-free nonlinear least-squares optimization
- Locally weighted regression models for surrogate-assisted design optimization
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Generating set search using simplex gradients for bound-constrained black-box optimization
- The limitation of neural nets for approximation and optimization
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Optimality Measures for Performance Profiles
- GOSAC: global optimization with surrogate approximation of constraints
- Hierarchically constrained blackbox optimization
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step
- Adaptive regularized quasi-Newton method using inexact first-order information
- Stochastic derivative-free optimization using a trust region framework
- A DFO technique to calibrate queueing models
- A subspace inertial method for derivative-free nonlinear monotone equations
- Full-low evaluation methods for derivative-free optimization
- Empirical study of the improved UNIRANDI local search method
- Best practices for comparing optimization algorithms
- Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- New subspace method for unconstrained derivative-free optimization
- First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
- On the global complexity of a derivative-free Levenberg-Marquardt algorithm via orthogonal spherical smoothing
- A frame-based conjugate gradients direct search method with radial basis function interpolation model
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Derivative-free robust optimization by outer approximations
- Monotonic grey box direct search optimization
- A batch, derivative-free algorithm for finding multiple local minima
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
This page was built for publication: Benchmarking Derivative-Free Optimization Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189556)
