A direct search package for unconstrained minimization

DOI10.1002/NME.1620200908MaRDI QIDQ3696406zbMATH OpenOpenAlexFDO

Authors

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

direct search methodhybrid algorithmunconstrained minimization

Mathematics Subject Classification ID

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

Cites work

• A Rapidly Convergent Descent Method for Minimization
• A Simplex Method for Function Minimization
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Function Minimization Without Evaluating Derivatives--a Review
• scientific article; zbMATH DE number 3476911 (Why is no real title available?)
• scientific article; zbMATH DE number 3382096 (Why is no real title available?)

Cited in

(2)

• Parallel Uzawa method for large-scale minimization of partially separable functions
• Incorporating minimum Frobenius norm models in direct search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3696406)