Efficient use of parallelism in algorithmic parameter optimization applications
From MaRDI portal
Publication:1941182
DOI10.1007/S11590-011-0428-6zbMath1268.90083OpenAlexW2030454071MaRDI QIDQ1941182
Dominique Orban, C.-K. Dang, Charles Audet
Publication date: 12 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0428-6
Related Items (3)
A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ Optimization of algorithms with OPAL ⋮ Monotonic grey box direct search optimization
Uses Software
Cites Work
- Restart strategies in optimization: parallel and serial cases
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Globalization strategies for mesh adaptive direct search
- Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
- Algorithm 909
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Algorithm 856
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Optimization and nonsmooth analysis
- Analysis of Generalized Pattern Searches
- Trust Region Methods
- Superlinear Convergence and Implicit Filtering
- Solving the Trust-Region Subproblem using the Lanczos Method
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEr and SifDec
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
This page was built for publication: Efficient use of parallelism in algorithmic parameter optimization applications
