Pages that link to "Item:Q5189556"

The following pages link to Benchmarking Derivative-Free Optimization Algorithms (Q5189556):

Displaying 50 items.

• A new error in variables model for solving positive definite linear system using orthogonal matrix decompositions (Q285053) (← links)
• Stochastic derivative-free optimization using a trust region framework (Q301671) (← links)
• Global optimization using \(q\)-gradients (Q322763) (← links)
• Selection of intensity modulated radiation therapy treatment beam directions using radial basis functions within a pattern search methods framework (Q386480) (← links)
• Computing of high breakdown regression estimators without sorting on graphics processing units (Q425179) (← links)
• On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure (Q477071) (← links)
• A modified DIRECT algorithm with bilevel partition (Q480826) (← links)
• Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems (Q486382) (← links)
• Inexact restoration method for nonlinear optimization without derivatives (Q492056) (← links)
• Globally convergent evolution strategies (Q494335) (← links)
• A penalty derivative-free algorithm for nonlinear constrained optimization (Q497458) (← links)
• Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963) (← links)
• An inexact restoration derivative-free filter method for nonlinear programming (Q520323) (← links)
• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
• Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions (Q652326) (← links)
• A quantitative metric for robustness of nonlinear algebraic equation solvers (Q654362) (← links)
• Locally weighted regression models for surrogate-assisted design optimization (Q724346) (← links)
• A DFO technique to calibrate queueing models (Q732891) (← links)
• SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications (Q743971) (← links)
• Survey of derivative-free optimization (Q827577) (← links)
• Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
• Equal angle distribution of polling directions in direct-search methods (Q896733) (← links)
• Mesh adaptive direct search with second directional derivative-based Hessian update (Q902088) (← links)
• Incorporating minimum Frobenius norm models in direct search (Q975361) (← links)
• A progressive barrier derivative-free trust-region algorithm for constrained optimization (Q1616931) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• Asynchronously parallel optimization solver for finding multiple minima (Q1621691) (← links)
• Accelerated random search for constrained global optimization assisted by radial basis function surrogates (Q1636769) (← links)
• Empirical study of the improved UNIRANDI local search method (Q1642808) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Stochastic optimization using a trust-region method and random models (Q1646570) (← links)
• Always convergent methods for nonlinear equations of several variables (Q1646676) (← links)
• Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (Q1653265) (← links)
• Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
• How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
• GOSAC: global optimization with surrogate approximation of constraints (Q1675641) (← links)
• Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
• Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods (Q1733327) (← links)
• RBFOpt: an open-source library for black-box optimization with costly function evaluations (Q1741116) (← links)
• Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
• On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
• Methods to compare expensive stochastic optimization algorithms with random restarts (Q1756805) (← links)
• Distributed Gauss-Newton optimization method for history matching problems with multiple best matches (Q1785159) (← links)
• Evaluating bound-constrained minimization software (Q1928747) (← links)
• Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization (Q1935888) (← links)
• Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (Q1993602) (← links)