Nongradient minimization methods for parallel processing computers. II

DOI10.1007/BF00933754zbMath0487.65038MaRDI QIDQ1165562

C. Sutti

Publication date: 1983

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationconvergenceparallel algorithmsiterative proceduresminimization algorithmsconjugate direction methodsnongradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (4)

Parallel variable metric algorithms for unconstrained optimization ⋮ Nongradient minimization methods for parallel processing computers. II ⋮ Space-decomposition minimization method for large-scale minimization problems ⋮ Vectorization of conjugate-gradient methods for large-scale minimization in meteorology

Cites Work

• Nongradient minimization methods for parallel processing computers. II
• On the accelerating property of an algorithm for function minimization without calculating derivatives
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nongradient minimization methods for parallel processing computers. II