Asynchronous Parallel Pattern Search for Nonlinear Optimization

DOI10.1137/S1064827599365823zbMath0990.65067OpenAlexW2067641876MaRDI QIDQ2719273

Virginia Torczon, Patricia D. Hough, Tamara G. Kolda

Publication date: 21 June 2001

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

fault tolerancetest problemsdistributed computingpattern searchcluster computingdirect searchasynchronous parallel optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Parallel numerical computation (65Y05) Distributed algorithms (68W15)

Related Items (23)

A batch, derivative-free algorithm for finding multiple local minima ⋮ Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Asynchronous parallel hybrid optimization combining DIRECT and GSS ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ Derivative-free trust region optimization for robust well control under geological uncertainty ⋮ Finding local optima of high-dimensional functions using direct search methods ⋮ Best practices for comparing optimization algorithms ⋮ Computing aviation sparing policies: solving a large nonlinear integer program ⋮ Additive scaling and the \texttt{DIRECT} algorithm ⋮ Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty ⋮ Optimal sizing and dispatch of solar power with storage ⋮ Numerical approach to solve imprecisely defined systems using inner outer direct search optimization technique ⋮ Parallel strategies for direct multisearch ⋮ A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ A particle swarm pattern search method for bound constrained global optimization ⋮ Decomposition in derivative-free optimization ⋮ Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems ⋮ Derivative-free optimization methods ⋮ Efficient well placement optimization under uncertainty using a virtual drilling procedure ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization ⋮ Control of dead-time systems using derivative free local search guided population based incremental learning algorithms

This page was built for publication: Asynchronous Parallel Pattern Search for Nonlinear Optimization