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
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, Global optimization using \(q\)-gradients, Stochastic optimization using a trust-region method and random models, Always convergent methods for nonlinear equations of several variables, Solving non-monotone equilibrium problems via a DIRECT-type approach, 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, 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, GOSAC: global optimization with surrogate approximation of constraints, Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework, Evaluating bound-constrained minimization software, Globally convergent evolution strategies for constrained optimization, Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization, Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification, Equal angle distribution of polling directions in direct-search methods, Mesh adaptive direct search with second directional derivative-based Hessian update, Computing of high breakdown regression estimators without sorting on graphics processing units, Benchmarking nonlinear optimization software in technical computing environments, Order-based error for managing ensembles of surrogates in mesh adaptive direct search, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, 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, A quantitative metric for robustness of nonlinear algebraic equation solvers, An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables, On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure, A modified DIRECT algorithm with bilevel partition, Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms, Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods, Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems, 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, Inexact restoration method for nonlinear optimization without derivatives, Globally convergent evolution strategies, A penalty derivative-free algorithm for nonlinear constrained optimization, Combining cross-entropy and MADS methods for inequality constrained global optimization, 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, Conjugate gradient path method without line search technique for derivative-free unconstrained optimization, Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch, An inexact restoration derivative-free filter method for nonlinear programming, Improving the convergence rate of the DIRECT global optimization algorithm, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm, Globally-biased disimpl algorithm for expensive global optimization, On convergence rate of a rectangular partition based global optimization algorithm, Methods to compare expensive stochastic optimization algorithms with random restarts, Performance of derivative free search ANN training algorithm with time series and classification problems, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, Incorporating minimum Frobenius norm models in direct search, A derivative-free trust-region algorithm for composite nonsmooth optimization, Tuning BARON using derivative-free optimization algorithms, Efficient large scale global optimization through clustering-based population methods, Distributed Gauss-Newton optimization method for history matching problems with multiple best matches, 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, Locally weighted regression models for surrogate-assisted design optimization, Performance indicators in multiobjective optimization, 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 DFO technique to calibrate queueing models, 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, A derivative-free Gauss-Newton method, SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications, Monotonic grey box direct search 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, A derivative-free algorithm for spherically constrained 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, An improved hybrid-ORBIT algorithm based on point sorting and MLE technique, Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations, Hierarchically constrained blackbox optimization, Dynamic improvements of static surrogates in direct search optimization, Linear equalities in blackbox optimization, Derivative-free methods for mixed-integer constrained optimization problems, A common framework for modified regula falsi methods and new methods of this kind, MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems, GLODS: global and local optimization using direct search, Review and comparison of algorithms and software for mixed-integer derivative-free optimization, On a primal-dual Newton proximal method for convex quadratic programs, The calculus of simplex gradients, 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
Uses Software
