Direct Search Methods on Parallel Machines
From MaRDI portal
Publication:4012427
DOI10.1137/0801027zbMath0754.90051OpenAlexW4244913592MaRDI QIDQ4012427
Virginia Torczon, John E. jun. Dennis
Publication date: 27 September 1992
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/101684
direct search methodsunconstrained optimizationderivative-free algorithmsmultidirectional searchNelder-Mead simplex algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Optimization with hidden constraints and embedded Monte Carlo computations, Unnamed Item, Survey of derivative-free optimization, A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization, Pattern search methods for finite minimax problems, Improved Nelder–Mead algorithm in high dimensions with adaptive parameters based on Chebyshev spacing points, Exploiting Problem Structure in Derivative Free Optimization, OpTIX-II: A software environment for the parallel solution of nonlinear optimization problems, Recent progress in unconstrained nonlinear optimization without derivatives, Enhancement of a viscous-inviscid-interaction airfoil analysis code using the parallel direct search algorithm, Efficient calculation of regular simplex gradients, Substitution algorithms for rational matrix equations, Frame-based ray search algorithms in unconstrained optimization, Implementing the Nelder-Mead simplex algorithm with adaptive parameters, A modified NM-PSO method for parameter estimation problems of models, Parallel strategies for direct multisearch, Multiprecision Algorithms for Computing the Matrix Logarithm, Experimental complexity analysis of continuous constraint satisfaction problems., A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization, Parallel Bayesian Global Optimization of Expensive Functions, A generating set search method using curvature information, Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods, Decomposition in derivative-free optimization, A direct search algorithm for global optimization, A parallel implementation of the simplex function minimization routine, Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems, Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch, Parallel two-phase methods for global optimization on GPU, Frame based methods for unconstrained optimization, A convergent variant of the Nelder--Mead algorithm, A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization, Constrained global optimization of expensive black box functions using radial basis functions, CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm, Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization, A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization, Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization, Multi-directional bat algorithm for solving unconstrained optimization problems, Optimization of a synthetic jet actuator for aerodynamic stall control, Exploiting problem structure in pattern search methods for unconstrained optimization, Derivative-free optimization methods, Solving the parameter identification problem of mathematical models using genetic algorithms
Uses Software
