Direct search methods: Then and now
From MaRDI portal
Publication:1593826
The authors discuss direct search methods for unconstrained optimization. They discuss how direct search methods are characterized by the absence of the construction of a model of the objective. The article is informative and well-written. It makes a rather pleasant introduction to a very active survey area.
Recommendations
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A Rapidly Convergent Descent Method for Minimization
- A Simplex Method for Function Minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Convergence Conditions for Ascent Methods
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Function Minimization Without Evaluating Derivatives--a Review
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- scientific article; zbMATH DE number 3302906 (Why is no real title available?)
- scientific article; zbMATH DE number 3334605 (Why is no real title available?)
- scientific article; zbMATH DE number 3067118 (Why is no real title available?)
- Lattice Approximations to the Minima of Functions of Several Variables
- Minimization of functions having Lipschitz continuous first partial derivatives
- Minimizing a function without calculating derivatives
- On the Convergence of Pattern Search Algorithms
- On the Convergence of the Multidirectional Search Algorithm
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Variable Metric Method for Minimization
Cited in
(71)- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- Adaptive robust control of Mecanum-wheeled mobile robot with uncertainties
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- Spatiotemporal interpolation through an extension of differential evolution algorithm for agricultural insurance claims
- A direct search algorithm for global optimization
- Global Newton-type methods and semismooth reformulations for NCP
- Parameter optimization in large-scale dynamical systems: A method of contractive mapping
- Extended global convergence framework for unconstrained optimization
- Constrained optimization involving expensive function evaluations: A sequential approach
- A robust desirability function method for multi-response surface optimization considering model uncertainty
- A reduced-space line-search method for unconstrained optimization via random descent directions
- Optimal cost analysis for discrete-time recurrent queue with Bernoulli feedback and emergency vacation
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
- Iteratively sampling scheme for stochastic optimization with variable number sample path
- A method for global minimization of functions using the Krawczyk operator
- Serving many masters: an agent and his principals
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Integration of expert knowledge into radial basis function surrogate models
- Calibration by optimization without using derivatives
- Finding local optima of high-dimensional functions using direct search methods
- Pattern search method for determination of DAEM kinetic parameters from nonisothermal TGA data of biomass
- Generalized Hamming networks and applications
- Convergence of the Nelder-Mead method
- A fully-distributed parallel global search algorithm
- A new direct search method based on separable fractional interpolation model
- Design and Analysis of Optimization Algorithms Using Computational Statistics
- A region-based multi-issue negotiation protocol for nonmonotonic utility spaces
- An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems
- Bilevel direct search method for leader-follower problems and application in health insurance
- Active Learning for Enumerating Local Minima Based on Gaussian Process Derivatives
- Derivative-free optimization and filter methods to solve nonlinear constrained problems
- A New Direct Search Optimization Method
- Die shape optimisation for net-shape accuracy in metal forming using direct search and localised response surface methods
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization
- scientific article; zbMATH DE number 1215248 (Why is no real title available?)
- Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- scientific article; zbMATH DE number 1368816 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- A stochastic local search algorithm for constrained continuous global optimization
- A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem
- A non-monotone pattern search approach for systems of nonlinear equations
- Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
- Derivative-free optimization methods
- A direct search approach to optimization for nonlinear model predictive control
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Optimizing partially separable functions without derivatives
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Hybrid Newton-type method for a class of semismooth equations
- Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique
- Two decades of blackbox optimization applications
- A new taxonomy of global optimization algorithms
- A method for simulation based optimization using radial basis functions
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- Adaptive dipole-like parameter calibration of complex black-box continuous processes
- Bi-level programming and multi-objective optimization for the distribution of resources in hierarchical organizations
- Cost scrutiny of discrete-time priority queue with cluster arrival and Bernoulli feedback
- Approximate dynamic programming via direct search in the space of value function approximations
- Revisiting the inverse transformation of undesirable factors in data envelopment analysis: a novel iterative algorithm
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Three points method for searching the best least absolute deviations plane
- High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems
- Survey of derivative-free optimization
- Spent potliner treatment process optimization using a MADS algorithm
- Grid restrained Nelder-Mead algorithm
- Conceptual, methodological and computational issues concerning the compartmental modeling of a complex biological system: Postprandial inter-organ metabolism of dietary nitrogen in humans
- Numerical solution for plasticity models using consistency bisection and a transformed-space closest-point return: a nongradient solution method
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- An improved version of Junmeng-Fang-Weiming-Fusheng approximation for the temperature integral
- Unconstrained derivative-free optimization by successive approximation
This page was built for publication: Direct search methods: Then and now
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593826)
