Answers are grounded in this paper and cite their sources.
The purpose of this paper is to describe an algorithm for unconstrained optimization which is suitable for execution on a parallel computer. A nongradient method similar in nature to Powell’s method is used and it is shown that the algorithm terminates at the minimum for quadratics and converges for strictly convex twice continuously differentiable functions.
No takes yet. Share an insight, caveat, or question.
Chazan et al. (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: