On the Convergence of the Multidirectional Search Algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1258332
- scientific article; zbMATH DE number 1552227
- scientific article; zbMATH DE number 4166732
- scientific article; zbMATH DE number 4080680
- 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
Cited in
(48)- Frame based methods for unconstrained optimization
- 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
- Direct search algorithm for bilevel programming problems
- p-MEMPSODE: parallel and irregular memetic global optimization
- Solving nonlinear programming problems with noisy function values and noisy gradients
- Convergence analysis of flow direction algorithm in continuous search space and its improvement
- Successive one-step-ahead predictions in multiple model predictive control
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- 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
- Exploiting Problem Structure in Derivative Free Optimization
- 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
- scientific article; zbMATH DE number 1552227 (Why is no real title available?)
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Grid-based methods for linearly equality constrained optimization problems
- Efficient calculation of regular simplex gradients
- Where do computational mathematics and computational statistics converge?
- 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
- Counterexample and an additional revealing poll step for a result of ``Analysis of direct searches for discontinuous functions
- 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
- A numerical method for interface reconstruction of triple points within a volume tracking algorithm
- Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
- On the Convergence of Pattern Search Algorithms
- On minimax designs when there are two candidate models
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Finding local optima of high-dimensional functions using direct search methods
- Recent progress in unconstrained nonlinear optimization without derivatives
- Pattern search method for discrete \(L_{1}\)-approximation
- scientific article; zbMATH DE number 4166732 (Why is no real title available?)
- Search procedure exploiting locally regularized objective approximation. A convergence theorem for direct search algorithms
- Derivative-free optimization methods
- 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)
