Efficient use of parallelism in algorithmic parameter optimization applications
From MaRDI portal
Recommendations
Cites work
- A progressive barrier for derivative-free nonlinear programming
- Algorithm 856
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Analysis of Generalized Pattern Searches
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- CUTEr and SifDec
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Globalization strategies for mesh adaptive direct search
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- Optimization and nonsmooth analysis
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Parallel processing of discrete problems. Proceedings of a workshop, IMA, Minneapolis, MN, USA, May 12--16, 1997
- Restart strategies in optimization: parallel and serial cases
- Solving the Trust-Region Subproblem using the Lanczos Method
- Superlinear Convergence and Implicit Filtering
- Trust Region Methods
Cited in
(11)- Efficient parallel algorithms for parameterized problems
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization
- A taxonomy of constraints in black-box simulation-based optimization
- Multialgorithms for parallel computing: A new paradigm for optimization
- Monotonic grey box direct search optimization
- To Parallelize or to Optimize?
- Parallelschnitte in der ganzzahligen optimierung
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- scientific article; zbMATH DE number 1302197 (Why is no real title available?)
- Optimization of algorithms with OPAL
- Efficient methods to organize the parallel execution of optimization algorithms
This page was built for publication: Efficient use of parallelism in algorithmic parameter optimization applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941182)
