On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
From MaRDI portal
Publication:2867433
Recommendations
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Direct Search Methods on Parallel Machines
- A General-Purpose Parallel Algorithm for Unconstrained Optimization
- scientific article; zbMATH DE number 2232726
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
Cites work
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A combined global \& local search (CGLS) approach to global optimization
- A derivative-free algorithm for bound constrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- 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
- Asynchronous parallel pattern search for nonlinear optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Developments of NEWUOA for minimization without derivatives
- Frame based methods for unconstrained optimization
- Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- New Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotonic trust region algorithm
- On the Convergence of Asynchronous Parallel Pattern Search
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Parallel variable distribution for constrained optimization
- Pattern Search Methods for Linearly Constrained Minimization
- Positive bases in numerical optimization
- Revisiting Asynchronous Parallel Pattern Search for Nonlinear Optimization
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Theory of Positive Linear Dependence
Cited in
(11)- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods
- Derivative-free optimization methods
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Decomposition in derivative-free optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
- scientific article; zbMATH DE number 2232726 (Why is no real title available?)
- Unified approach for solving box-constrained models with continuous or discrete variables by non monotone direct search methods
This page was built for publication: On sequential and parallel non-monotone derivative-free algorithms for box constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867433)
