Results 11 to 20 of about 730,500 (301)

Parallel Direct Search Methods

open access: yesAL-Rafidain Journal of Computer Sciences and Mathematics, 2010
Mostly minimization or maximization of a function is very expensive. Since function evaluation of the objective function requires a considerable time.
Bashir Khalaf, Mohammed Al-Neama
openaire   +3 more sources

Two decades of blackbox optimization applications

open access: yesEURO Journal on Computational Optimization, 2021
This article reviews blackbox optimization applications of direct search optimization methods over the past twenty years. Emphasis is placed on the Mesh Adaptive Direct Search (Mads) derivative-free optimization algorithm.
Stéphane Alarie   +4 more
doaj   +1 more source

Genetic Algorithms as Computational Methods for Finite-Dimensional Optimization

open access: yesКібернетика та комп'ютерні технології, 2021
Introduction. As early as 1744, the great Leonhard Euler noted that nothing at all took place in the universe in which some rule of maximum or minimum did not appear [12].
Nataliya Gulayeva   +2 more
doaj   +1 more source

Machine Learning and miRNAs as Potential Biomarkers of Breast Cancer: A Systematic Review of Classification Methods

open access: yesApplied Sciences, 2023
This work aims to offer an analysis of empirical research on the automatic learning methods used in detecting microRNA (miRNA) as potential markers of breast cancer.
Jorge Alberto Contreras-Rodríguez   +3 more
doaj   +1 more source

A Direct Search Algorithm for Global Optimization

open access: yesAlgorithms, 2016
A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations.
Enrique Baeyens   +2 more
doaj   +1 more source

Retraction-Based Direct Search Methods for Derivative Free Riemannian Optimization [PDF]

open access: yes, 2023
Direct search methods represent a robust and reliable class of algorithms for solving black-box optimization problems. In this paper, the application of those strategies is exported to Riemannian optimization, wherein minimization is to be performed with
Rinaldi F., Zeffiro D., Kungurtsev V.
core   +1 more source

Comparing variable neighbourhood search algorithms for the direct aperture optimisation in radiotherapy [PDF]

open access: yesPeerJ Computer Science
Intensity modulated radiation therapy (IMRT) is a prevalent approach for administering radiation therapy in cancer treatment. The primary objective of IMRT is to devise a treatment strategy that eradicates cancer cells from the tumour while minimising ...
Mauricio Moyano   +5 more
doaj   +2 more sources

Effectiveness of quadrat sampling on terrestrial cave fauna survey - a case study in a Neotropical cave

open access: yesActa Scientiarum: Biological Sciences, 2015
Quadrat sampling is a method used for a long time in plant ecology studies but only recently it has been used with focus on fauna. For the cave fauna samplings, there are rare works applying this methodology.
Maria Elina Bichuette   +3 more
doaj   +1 more source

Direct search methods for influence maximization problems [PDF]

open access: yes, 2023
openThe influence maximization problem seeks to maximize the spread of influence in network structures. This challenging optimization task remains unsolved due to its combinatorial nature and computational complexity. In this thesis, we propose two novel
BERGAMASCHI, MATTEO
core  

Tuning approximate dynamic programming policies for ambulance redeployment via direct search

open access: yesStochastic Systems, 2014
In this paper we consider approximate dynamic programming methods for ambulance redeployment. We first demonstrate through simple examples how typical value function fitting techniques, such as approximate policy iteration and linear programming, may not
Matthew S. Maxwell   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy