Efficient use of parallelism in algorithmic parameter optimization applications
type: Item
instance of: scholarly article
title: Efficient use of parallelism in algorithmic parameter optimization applications
zbMATH Open document ID: 1268.90083
author: Charles Audet
author: C.-K. Dang
author: D. Orban
published in: Optimization Letters
publication date: 2013-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6143308
zbMATH Keywords: algorithmic parameter optimization
zbMATH Keywords: direct search
zbMATH Keywords: parallelism
describes a project that uses: GALAHAD
describes a project that uses: SifDec
describes a project that uses: OPAL
describes a project that uses: OrthoMADS
describes a project that uses: CUTEr
describes a project that uses: NOMAD
describes a project that uses: APPSPACK
MaRDI profile type: Publication
full work available at URL: s11590-011-0428-6
OpenAlex ID: W2030454071
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
cites work: Globalization strategies for mesh adaptive direct search
cites work: Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
cites work: Superlinear Convergence and Implicit Filtering
cites work: Optimization and nonsmooth analysis
cites work: Trust Region Methods
cites work: Introduction to Derivative-Free Optimization
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: CUTEr and SifDec
cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
cites work: Algorithm 856
cites work: Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
cites work: Algorithm 909
cites work: Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
cites work: Restart strategies in optimization: parallel and serial cases
DOI: 10.1007/S11590-011-0428-6
description: scientific article; zbMATH DE number 6143308