Benchmarking Derivative-Free Optimization Algorithms
From MaRDI portal
Publication:5189556
DOI10.1137/080724083zbMath1187.90319OpenAlexW2057830724MaRDI QIDQ5189556
Publication date: 17 March 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080724083
Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20)
Related Items (only showing first 100 items - show all)
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 ⋮ On the numerical performance of finite-difference-based methods for derivative-free optimization ⋮ Full-low evaluation methods for derivative-free optimization ⋮ An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems ⋮ Global optimization for mixed categorical-continuous variables based on Gaussian process models with a randomized categorical space exploration step ⋮ Model-Based Derivative-Free Methods for Convex-Constrained Optimization ⋮ Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points ⋮ A derivative-free comirror algorithm for convex optimization ⋮ A trust-region derivative-free algorithm for constrained optimization ⋮ Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components ⋮ Exploiting Problem Structure in Derivative Free Optimization ⋮ Constrained derivative-free optimization on thin domains ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ A subclass of generating set search with convergence to second-order stationary points ⋮ A frame-based conjugate gradients direct search method with radial basis function interpolation model ⋮ Performance of a coordinate search ANN training algorithm ⋮ Binary, unrelaxable and hidden constraints in blackbox optimization ⋮ Escaping local minima with local derivative-free methods: a numerical investigation ⋮ Scalable subspace methods for derivative-free nonlinear least-squares optimization ⋮ A new black box method for monotone nonlinear equations ⋮ 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 superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root ⋮ A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ A merit function approach for evolution strategies ⋮ A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression ⋮ Derivative-Free Optimization for Population Dynamic Models ⋮ A subset-selection-based derivative-free optimization algorithm for dynamic operation optimization in a steel-making process ⋮ Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Quadratic regularization methods with finite-difference gradient approximations ⋮ Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization ⋮ A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization ⋮ Worst-case evaluation complexity of a derivative-free quadratic regularization method ⋮ A derivative-free optimization algorithm combining line-search and trust-region techniques ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Mean-based Borda count for paradox-free comparisons of optimization algorithms ⋮ Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods ⋮ Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming ⋮ On FISTA with a relative error rule ⋮ Parallel strategies for direct multisearch ⋮ A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions ⋮ Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints ⋮ Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods ⋮ The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables ⋮ A Modified Coordinate Search Method Based on Axes Rotation ⋮ A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization ⋮ Global non-smooth optimization in robust multivariate regression ⋮ Use of quadratic models with mesh-adaptive direct search for constrained black box optimization ⋮ A surrogate management framework using rigorous trust-region steps ⋮ Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers ⋮ A second-order globally convergent direct-search method and its worst-case complexity ⋮ Simulation optimization: a review of algorithms and applications ⋮ 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 ⋮ An active-set trust-region method for derivative-free nonlinear bound-constrained optimization ⋮ A Method for Constrained Multiobjective Optimization Based on SQP Techniques ⋮ Derivative-free optimization methods ⋮ Benchmarking deterministic optimization algorithms using an outranking approach ⋮ A Derivative-Free Method for Structured Optimization Problems ⋮ Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise ⋮ A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ1regularized problem ⋮ Unnamed Item ⋮ Manifold Sampling for $\ell_1$ Nonconvex Optimization ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ ESTIMATION OF DYNAMIC DISCRETE CHOICE MODELS BY MAXIMUM LIKELIHOOD AND THE SIMULATED METHOD OF MOMENTS ⋮ Non-intrusive termination of noisy optimization ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization ⋮ Optimization of Stochastic Blackboxes with Adaptive Precision ⋮ A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles ⋮ CONORBIT: constrained optimization by radial basis function interpolation in trust regions ⋮ Derivative-free optimization and neural networks for robust regression ⋮ A Note on Performance Profiles for Benchmarking Software ⋮ The optimization test environment ⋮ A progressive barrier derivative-free trust-region algorithm for constrained optimization ⋮ Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ Survey of derivative-free optimization ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions ⋮ Stochastic derivative-free optimization using a trust region framework ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Accelerated random search for constrained global optimization assisted by radial basis function surrogates ⋮ A theoretical and empirical comparison of gradient approximations in derivative-free optimization ⋮ Efficient unconstrained black box optimization ⋮ Empirical study of the improved UNIRANDI local search method ⋮ Best practices for comparing optimization algorithms
Uses Software
This page was built for publication: Benchmarking Derivative-Free Optimization Algorithms
