A direct search package for unconstrained minimization

DOI10.1002/nme.1620200908zbMath0576.65059OpenAlexW2122468151MaRDI QIDQ3696406

No author found.

Publication date: 1984

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620200908

zbMATH Keywords

unconstrained minimizationdirect search methodhybrid algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

Parallel Uzawa method for large-scale minimization of partially separable functions

Cites Work

• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• A Rapidly Convergent Descent Method for Minimization
• Function Minimization Without Evaluating Derivatives--a Review
• A Simplex Method for Function Minimization
• Unnamed Item
• Unnamed Item

This page was built for publication: A direct search package for unconstrained minimization