Direct search methods: Then and now
type: Item
instance of: scholarly article
title: Direct search methods: Then and now
zbMATH Open document ID: 0969.65055
DOI: 10.1016/S0377-0427(00)00423-4
author: Virginia J. Torczon
author: Michael W. Trosset
author: Robert Michael Lewis
published in: Journal of Computational and Applied Mathematics
publication date: 2001-01-25T00:00:00Z
review text: 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.
reviewed by: Akrur Behera
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 1556989
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: direct search methods
zbMATH Keywords: pattern search method
zbMATH Keywords: Powell's method
describes a project that uses: fminsearch
MaRDI profile type: Publication
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Lattice Approximations to the Minima of Functions of Several Variables
cites work: Q5806242
cites work: A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
cites work: Q5612126
cites work: Variable Metric Method for Minimization
cites work: Function Minimization Without Evaluating Derivatives--a Review
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: Q5584384
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
cites work: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
cites work: A Simplex Method for Function Minimization
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: On the Convergence of Pattern Search Algorithms
cites work: Convergence Conditions for Ascent Methods
cites work: Q4878831
cites work: Minimizing a function without calculating derivatives
full work available at URL: s0377-0427(00)00423-4
OpenAlex ID: W1999024797
description: scientific article; zbMATH DE number 1556989