Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer

DOI10.1007/BF00934295zbMath0504.65038OpenAlexW1972090158MaRDI QIDQ1836281

E. C. Housos, Omar Wing

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1007/bf00934295

zbMATH Keywords

unconstrained optimizationparallel processingconjugate directionsparallel multidirectional algorithmsparallel unidirectional algorithmspseudo-conjugate directions

Mathematics Subject Classification ID

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

Related Items

Space-decomposition minimization method for large-scale minimization problems ⋮ Vectorization of conjugate-gradient methods for large-scale minimization in meteorology

Cites Work

• Study on a supermemory gradient method for the minimization of functions
• A Rapidly Convergent Descent Method for Minimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• A Nongradient and Parallel Algorithm for Unconstrained Minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item