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)- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- Asynchronously parallel optimization solver for finding multiple minima
- Accelerated random search for constrained global optimization assisted by radial basis function surrogates
- Empirical study of the improved UNIRANDI local search method
- Best practices for comparing optimization algorithms
- Stochastic optimization using a trust-region method and random models
- Always convergent methods for nonlinear equations of several variables
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- GOSAC: global optimization with surrogate approximation of constraints
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Calibration of parameters in dynamic energy budget models using direct-search methods
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- On convergence rate of a rectangular partition based global optimization algorithm
- Methods to compare expensive stochastic optimization algorithms with random restarts
- Distributed Gauss-Newton optimization method for history matching problems with multiple best matches
- Evaluating bound-constrained minimization software
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- Benchmarking nonlinear optimization software in technical computing environments
- Combining cross-entropy and MADS methods for inequality constrained global optimization
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Efficient large scale global optimization through clustering-based population methods
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- Performance indicators in multiobjective optimization
- DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization
- A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints
- A method for convex black-box integer global optimization
- Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
- A zeroth order method for stochastic weakly convex optimization
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems
- Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations
- Hierarchically constrained blackbox optimization
- A common framework for modified regula falsi methods and new methods of this kind
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization
- On a primal-dual Newton proximal method for convex quadratic programs
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Efficient unconstrained black box optimization
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization
- On the implementation of a global optimization method for mixed-variable problems
- An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- 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
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Benchmarking optimization software -- a (Hi)story
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- PRP-like algorithm for monotone operator equations
- Globally-biased disimpl algorithm for expensive global optimization
- Performance of derivative free search ANN training algorithm with time series and classification problems
- Tuning BARON using derivative-free optimization algorithms
- Mesh adaptive direct search with simplicial Hessian update
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Derivative-free robust optimization by outer approximations
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds
- A derivative-free Gauss-Newton method
- Monotonic grey box direct search optimization
- A derivative-free algorithm for spherically constrained optimization
- An improved hybrid-ORBIT algorithm based on point sorting and MLE technique
- Dynamic improvements of static surrogates in direct search optimization
- Linear equalities in blackbox optimization
- Derivative-free methods for mixed-integer constrained optimization problems
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- GLODS: global and local optimization using direct search
- The calculus of simplex gradients
- The optimization test environment
- Sustainability SI: optimal prices of electricity at public charging stations for plug-in electric vehicles
- Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm
- MISO: mixed-integer surrogate optimization framework
- A batch, derivative-free algorithm for finding multiple local minima
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Constrained derivative-free optimization on thin domains
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A frame-based conjugate gradients direct search method with radial basis function interpolation model
- A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Binary, unrelaxable and hidden constraints in blackbox optimization
- Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates
- Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods
- On FISTA with a relative error rule
- Parallel strategies for direct multisearch
- A second-order globally convergent direct-search method and its worst-case complexity
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- A method for constrained multiobjective optimization based on SQP techniques
- Benchmarking deterministic optimization algorithms using an outranking approach
- A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions
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)
