Parallel Jacobi methods for derivative-free optimization on parallel or distributed processors

I. D. Coope, M. S. Macklem

Abstract


New Jacobi-type algorithms are presented for the efficient use of parallel and distributed computing platforms in solving derivative-free optimization problems. The implementations are designed to be fault tolerant to be applicable to science and engineering problems where occasionally requests for function values may not be met and derivatives are never available. Convergence is usually achieved by introducing an elementary trust region subproblem at synchronization steps in the algorithm. This has the added advantage of handling negative curvature very conveniently.

Full Text:

PDF BibTeX


DOI: http://dx.doi.org/10.21914/anziamj.v46i0.986



Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.