Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm | Zendy

Charles Audet | Zendy; J. E. Dennis | Zendy; Sébastien Le Digabel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

Author(s) -

Charles Audet,

J. E. Dennis,

Sébastien Le Digabel

Publication year - 2008

Publication title -

siam journal on optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 2.066

H-Index - 136

eISSN - 1095-7189

pISSN - 1052-6234

DOI - 10.1137/070707518

Subject(s) - mathematics , convergence (economics) , mathematical optimization , algorithm , asynchronous communication , space (punctuation) , decomposition , parallel algorithm , computer science , computer network , ecology , economics , biology , operating system , economic growth

This paper describes a parallel space decomposition PSD technique for the mesh adaptive direct search MADS algorithm. MADS extends a generalized pattern search for constrained nonsmooth optimization problems. The objective of the present work is to obtain good solutions to larger problems than the ones typically solved by MADS. The new method PSD-MADS is an asynchronous parallel algorithm in which the processes solve problems over subsets of variables. The convergence analysis based on the Clarke calculus is essentially the same as for the MADS algorithm. A practical implementation is described, and some numerical results on problems with up to 500 variables illustrate the advantages and limitations of PSD-MADS.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research