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

DOI10.1007/BF00934295MaRDI QIDQ1836281zbMATH OpenOpenAlexFDO

Authors 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

conjugate directionsparallel multidirectional algorithmsparallel processingparallel unidirectional algorithmspseudo-conjugate directionsunconstrained optimization

Mathematics Subject Classification ID

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

Cites work

• A Nongradient and Parallel Algorithm for Unconstrained Minimization
• A Rapidly Convergent Descent Method for Minimization
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• scientific article; zbMATH DE number 3731771 (Why is no real title available?)
• scientific article; zbMATH DE number 3507890 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3356498 (Why is no real title available?)
• Study on a supermemory gradient method for the minimization of functions

Cited in

(2)

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

This page was built for publication: Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer

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