New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4128663
- scientific article; zbMATH DE number 3911607
- Unconstrained derivative-free optimization by successive approximation
- A derivative-free algorithm for unconstrained optimization
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- scientific article; zbMATH DE number 90302
- Sequential penalty derivative-free methods for nonlinear constrained optimization
- New conjugate gradient-like methods for unconstrained optimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Cited in
(23)- A combined global \& local search (CGLS) approach to global optimization
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- Derivative-free methods for mixed-integer constrained optimization problems
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- Alternating minimization as sequential unconstrained minimization: a survey
- Decomposition in derivative-free optimization
- Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Unconstrained derivative-free optimization by successive approximation
- scientific article; zbMATH DE number 4128663 (Why is no real title available?)
- Explicit gradient information in multiobjective optimization
- Adapting derivative free optimization methods to engineering models with discrete variables
- Pattern search methods for finite minimax problems
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
- Asynchronously parallel optimization solver for finding multiple minima
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- Derivative-free optimization methods
This page was built for publication: New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785870)
