New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
From MaRDI portal
Publication:4785870
DOI10.1137/S1052623400370606zbMath1049.90133OpenAlexW2058407505MaRDI QIDQ4785870
No author found.
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400370606
unconstrained minimizationparallel algorithmsnecessary and sufficient conditionsderivative-free algorithmnonsmooth function
Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)
Related Items (18)
Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods ⋮ Derivative-free methods for mixed-integer nonsmooth constrained optimization ⋮ Adapting derivative free optimization methods to engineering models with discrete variables ⋮ Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization ⋮ An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables ⋮ Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods ⋮ Decomposition in derivative-free optimization ⋮ Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch ⋮ A combined global \& local search (CGLS) approach to global optimization ⋮ Sprouting search—an algorithmic framework for asynchronous parallel unconstrained optimization ⋮ Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study ⋮ A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations ⋮ Explicit gradient information in multiobjective optimization ⋮ Derivative-free optimization methods ⋮ Derivative-free methods for mixed-integer constrained optimization problems ⋮ On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Uses Software
This page was built for publication: New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
