On the Convergence of the Multidirectional Search Algorithm
From MaRDI portal
Publication:4017643
DOI10.1137/0801010zbMath0752.90076OpenAlexW2064558818MaRDI QIDQ4017643
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
convergence analysisunconstrained minimizationpattern search algorithmfactorial design algorithmmultidirectional search algorithmNedler-Mead simplex algorithm
Nonlinear programming (90C30) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (41)
A non-monotone pattern search approach for systems of nonlinear equations ⋮ Nonparametric estimation of the mixing distribution in logistic regression mixed models with random intercepts and slopes ⋮ Survey of derivative-free optimization ⋮ A method of trust region type for minimizing noisy functions ⋮ Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods ⋮ p-MEMPSODE: parallel and irregular memetic global optimization ⋮ Finding local optima of high-dimensional functions using direct search methods ⋮ Successive one-step-ahead predictions in multiple model predictive control ⋮ On minimax designs when there are two candidate models ⋮ Exploiting Problem Structure in Derivative Free Optimization ⋮ Bilevel direct search method for leader-follower problems and application in health insurance ⋮ A numerical method for interface reconstruction of triple points within a volume tracking algorithm ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Recent progress in unconstrained nonlinear optimization without derivatives ⋮ A frame-based conjugate gradients direct search method with radial basis function interpolation model ⋮ Grid-based methods for linearly equality constrained optimization problems ⋮ A switching-method for nonlinear systems ⋮ Efficient calculation of regular simplex gradients ⋮ Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique ⋮ Augmented Lagrangian Pattern Search Based Multi-Agent Model Predictive Control of Rhine-Meuse Delta ⋮ A derivative-free optimization algorithm combining line-search and trust-region techniques ⋮ GPU parameter tuning for tall and skinny dense linear least squares problems ⋮ Frame-based ray search algorithms in unconstrained optimization ⋮ Experimental complexity analysis of continuous constraint satisfaction problems. ⋮ Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions ⋮ Pattern search method for discrete \(L_{1}\)-approximation ⋮ Decomposition in derivative-free optimization ⋮ Frame based methods for unconstrained optimization ⋮ Direct search algorithm for bilevel programming problems ⋮ Solving nonlinear programming problems with noisy function values and noisy gradients ⋮ A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ Generating set search using simplex gradients for bound-constrained black-box optimization ⋮ Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees ⋮ Estimation and prediction with ARMMAX model: a mixture of ARMAX models with common ARX part ⋮ Generalized pattern search methods for a class of nonsmooth optimization problems with structure ⋮ Derivative-free optimization methods ⋮ Vertex Exchange Method for non-parametric estimation of mixing distributions in logistic mixed models ⋮ Direct search methods: Then and now ⋮ Optimizing color picture tubes by high-cost nonlinear programming ⋮ A method for solving some optimization problems with bounds on variables
This page was built for publication: On the Convergence of the Multidirectional Search Algorithm