How to parallelize ``non-parallelizable minimization functions
From MaRDI portal
How to parallelize ``non-parallelizable'' minimization functions
Cites work
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- A Family of Variable-Metric Methods Derived by Variational Means
- A Limited Memory Algorithm for Bound Constrained Optimization
- A locally-biased form of the DIRECT algorithm.
- A new approach to variable metric algorithms
- A Simplex Method for Function Minimization
- A simplicial homology algorithm for Lipschitz optimisation
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An updated set of basic linear algebra subprograms (BLAS)
- Conditioning of Quasi-Newton Methods for Function Minimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- scientific article; zbMATH DE number 4055377 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3385582 (Why is no real title available?)
- LAPACK Users' Guide
- Lipschitzian optimization without the Lipschitz constant
- Methods of conjugate gradients for solving linear systems
- Newton-Type Minimization via the Lanczos Method
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- Solving the Trust-Region Subproblem using the Lanczos Method
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Trust Region Methods
This page was built for publication: How to parallelize ``non-parallelizable minimization functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307602)
