Direct Search Methods on Parallel Machines [PDF]
SIAM Journal on Optimization, 1991 Summary: This paper describes an approach to constructing derivative-free algorithms for unconstrained optimization that are easy to implement on parallel machines. A special feature of this approach is the ease with which algorithms can be generated to take advantage of any number of processors and to adapt to any cost ratio of communication to ...
John E. Dennis Jr., Virginia Torczon
openaire +3 more sources
Out of the Niche: Using Direct Search Methods to Find Multiple Global Optima
Mathematics, 2022 Multimodal optimization deals with problems where multiple feasible global solutions coexist. Despite sharing a common objective function value, some global optima may be preferred to others for various reasons.
Javier Cano +3 more
doaj +3 more sources
Direct search methods: then and now
Journal of Computational and Applied Mathematics, 2000 The authors discuss direct search methods for unconstrained optimization. They discuss how direct search methods are characterized by the absence of the construction of a model of the objective. The article is informative and well-written. It makes a rather pleasant introduction to a very active survey area.
Lewis, Robert Michael +2 more
openaire +3 more sources
Tabu Search directed by direct search methods for nonlinear global optimization [PDF]
European Journal of Operational Research, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdel-Rahman Hedar, Masao Fukushima
openaire +3 more sources
Direct, indirect and intangible costs incurred by leptospirosis patients: the magnitude, aspects and methods of assessing the costs – a systematic review and meta-analysis protocol [PDF]
BMJ OpenIntroduction Leptospirosis is a significant public health concern worldwide, as it imposes a substantial economic burden on the global economy. Despite a comprehensive search of the relevant literature, few studies evaluating the economic burden ...
Nuwan Darshana Wickramasinghe +4 more
doaj +2 more sources
Inexact direct-search methods for bilevel optimization problems
Computational Optimization and ApplicationsAbstractIn this work, we introduce new direct-search schemes for the solution of bilevel optimization (BO) problems. Our methods rely on a fixed accuracy blackbox oracle for the lower-level problem, and deal both with smooth and potentially nonsmooth true objectives.
Youssef Diouane +3 more
openaire +5 more sources
Policy search with rare significant events: Choosing the right partner to cooperate with
PLoS ONE, 2022 This paper focuses on a class of reinforcement learning problems where significant events are rare and limited to a single positive reward per episode.
Paul Ecoffet +3 more
doaj +2 more sources
Less is more: Simplified Nelder-Mead method for large unconstrained optimization [PDF]
Yugoslav Journal of Operations Research, 2018 Nelder-Mead method (NM) for solving continuous non-linear optimization problem is probably the most cited and the most used method in the optimization literature and in practical applications, too.
Gonçalves-E-Silva Kayo +3 more
doaj +1 more source
New methods for developing parallel algorithms of direct search in numerical optimization [PDF]
مجلة التربية والعلم, 2013 The Purpose of this research is the development Direct Search Methods for minimizing the objective function; The Developed Methods reduces the approach time to the minimum through two techniques: 1) by reducing the number of function evaluation.
Firas Mahmood Saeed +1 more
doaj +1 more source
Interactive statistical computer program for multiple non-linear curves fitting using stochastic algorithms [PDF]
Computational Ecology and Software, 2021 An interactive computer program for multiple nonlinear curves fitting has been developed in this work. Several optimization algorithms have been implemented in this software for solving constrained and unconstrained nonlinear optimization models in order
Muhammad Tlas +2 more
doaj