On the Convergence of the Multidirectional Search Algorithm

DOI10.1137/0801010zbMATH Open0752.90076OpenAlexW2064558818MaRDI QIDQ4017643FDOQ4017643

Publication date: 16 January 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801010

Recommendations

scientific article; zbMATH DE number 1258332
scientific article; zbMATH DE number 1552227
scientific article
scientific article
On Linear Convergence of a Class of Random Search Algorithms
scientific article; zbMATH DE number 4031420
On the convergence of tabu search
On the Convergence of Pattern Search Algorithms
scientific article; zbMATH DE number 3901926
scientific article; zbMATH DE number 4020863

convergence analysis unconstrained minimization pattern search algorithm factorial design algorithm multidirectional search algorithm Nedler-Mead simplex algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (45)

Estimation and prediction with ARMMAX model: a mixture of ARMAX models with common ARX part
A method for solving some optimization problems with bounds on variables
Survey of derivative-free optimization
Optimizing color picture tubes by high-cost nonlinear programming
p-MEMPSODE: parallel and irregular memetic global optimization
Direct search algorithm for bilevel programming problems
Convergence analysis of flow direction algorithm in continuous search space and its improvement
Solving nonlinear programming problems with noisy function values and noisy gradients
Successive one-step-ahead predictions in multiple model predictive control
Generalized pattern search methods for a class of nonsmooth optimization problems with structure
Exploiting Problem Structure in Derivative Free Optimization
A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization
Nonparametric estimation of the mixing distribution in logistic regression mixed models with random intercepts and slopes
A non-monotone pattern search approach for systems of nonlinear equations
Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
Experimental complexity analysis of continuous constraint satisfaction problems.
Decomposition in derivative-free optimization
Title not available (Why is that?)
Generating set search using simplex gradients for bound-constrained black-box optimization
Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
Where do computational mathematics and computational statistics converge?
Grid-based methods for linearly equality constrained optimization problems
Efficient calculation of regular simplex gradients
A frame-based conjugate gradients direct search method with radial basis function interpolation model
Vertex Exchange Method for non-parametric estimation of mixing distributions in logistic mixed models
A switching-method for nonlinear systems
A derivative-free optimization algorithm combining line-search and trust-region techniques
Frame-based ray search algorithms in unconstrained optimization
Augmented Lagrangian Pattern Search Based Multi-Agent Model Predictive Control of Rhine-Meuse Delta
A method of trust region type for minimizing noisy functions
Direct search methods: Then and now
Bilevel direct search method for leader-follower problems and application in health insurance
Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique
GPU parameter tuning for tall and skinny dense linear least squares problems
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
A numerical method for interface reconstruction of triple points within a volume tracking algorithm
On minimax designs when there are two candidate models
Finding local optima of high-dimensional functions using direct search methods
Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
Recent progress in unconstrained nonlinear optimization without derivatives
Pattern search method for discrete \(L_{1}\)-approximation
Title not available (Why is that?)
Derivative-free optimization methods
Frame based methods for unconstrained optimization
Derivative-free optimization: a review of algorithms and comparison of software implementations

This page was built for publication: On the Convergence of the Multidirectional Search Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017643)