Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems

DOI10.1080/10556788.2014.997877zbMath1328.90137OpenAlexW1993164115MaRDI QIDQ3458824

Majid Jaberipour, Behrooz Karimi, Esmaile Khorram

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2014.997877

zbMATH Keywords

particle swarmbound constrained problemsderivative-freenon-linear programmingunconstrained problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Spent potliner treatment process optimization using a MADS algorithm
• A computational framework for derivative-free optimization of cardiovascular geometries
• Lipschitzian optimization without the Lipschitz constant
• A deterministic algorithm for global optimization
• A particle swarm pattern search method for bound constrained global optimization
• Optimal aeroacoustic shape design using the surrogate management framework
• On the Convergence of Grid-Based Methods for Unconstrained Optimization
• Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination
• A cover partitioning method for bound constrained global optimization
• On the Convergence of Pattern Search Algorithms
• Quantitative Object Reconstruction Using Abel Transform X-Ray Tomography and Mixed Variable Optimization
• Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms
• PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
• Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
• Using Sampling and Simplex Derivatives in Pattern Search Methods
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• Optimization and nonsmooth analysis
• `` Direct Search Solution of Numerical and Statistical Problems
• Pattern Search Methods for Linearly Constrained Minimization
• Pattern Search Algorithms for Bound Constrained Minimization
• On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
• CUTEr and SifDec
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• A Simplex Method for Function Minimization
• Benchmarking optimization software with performance profiles.
• A derivative-free algorithm for bound constrained optimization
• Using DIRECT to solve an aircraft routing problem

This page was built for publication: Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems