27 papers · ranked by Valyu relevance
Dimitris Bertsimas, Berk Öztürk
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to…
Yuanyuan Liu
This paper propose a new frame work for finding global minima which we call optimization by cut. In each iteration, it takes some samples from the feasible region and evaluates the objective function at these points. Based on the observations it cuts off from the feasible region a subregion that is unlikely to contain…
Authors not listed
With the ever-increasing demand for atomistic structures representative of real-life systems as well as the ad-vent of exascale computers, it has now become necessary and possible to use advanced global optimization (GO) techniques to intelligently sample the potential energy surface (PES). Given the previous studies…
Ming Li
Gradient descent is the most commonly used optimization method, but limited to local optimality, and confined to the field of continuous differentiable problems with simple convex constraints. This work solve these limitations and restrictions by unifying all optimization problems with various complex constraints as a…
Seifeddine Achour
Global minimization is a fundamental challenge in optimization, especially in machine learning, where finding the global minimum of a function directly impacts model performance and convergence. This article introduces a novel optimization method that we called Super Gradient Descent, designed specifically for…
Michael Freitas Gustavo, Toon Verstraelen
In this work we explore the properties which make many real-life global optimization problems extremely difficult to handle, and some of the common techniques used in literature to address them. We then introduce a general optimization management tool called GloMPO (Globally Managed Parallel Optimization) to help…
Kaan Gökcesu, Hakan Gökcesu
—This study presents an effective global optimization technique designed for multivariate functions that are Holder ¨ continuous. Unlike traditional methods that construct lower bounding proxy functions, this algorithm employs a predetermined query creation rule that makes it computationally superior. The algorithm's…
Sarit Maitra
This paper presents an innovative optimization framework and algorithm based on the Bayes theorem, featuring adaptive conditioning and jitter. The adaptive conditioning function dynamically modifies the mean objective function in each iteration, enhancing its adaptability. The mean function, representing the model's…
Yifan Wu, Aron Walsh, Alex Ganose
What is the minimum number of experiments, or calculations, required to find an optimal solution? Relevant chemical problems range from identifying a compound with target functionality within a given phase space to controlling materials synthesis and device fabrication conditions. A common feature in this application…
Authors not listed
Swarm intelligence-based algorithms have proven successful in exploring a potential energy surfaces (PESs) of chemical systems. One of the major limitations to recent implementations of these algorithms is that they have been implemented serially. To overcome this limitation we present our asynchronously parallel…
Delong Guo, Huajuan Huang, Yinggao Yue
The Honey Badger Algorithm (HBA) is a recently proposed metaheuristic optimization algorithm inspired by the foraging behavior of honey badgers. The search mechanism of this algorithm is divided into two phases: a mining phase and a honey-seeking phase, effectively emulating the processes of exploration and…
Georges Czaplicki, Serge Mazeres
Model validation depends on the agreement between the predicted and experimental data. However, finding solutions to problems, described by equations with many parameters, for which virtually nothing is known, is a difficult task. For example, the extraction of kinetic parameters from complex schemes representing the…
Máté Mohácsi, Márk Patrik Török, Sára Sáray, Luca Tar + 1 more
Finding optimal parameters for detailed neuronal models is a ubiquitous challenge in neuroscientific research. Recently, manual model tuning has been replaced by automated parameter search using a variety of different tools and methods. However, using most of these software tools and choosing the most appropriate…
Guanjun Lin, Mahmoud Abdel-salam, Gang Hu, Heming Jia + 1 more
'Yongquan Zhou'] The Parrot Optimization Algorithm (PO) represents a contemporary nature-inspired metaheuristic technique formulated through observations of Pyrrhura Molinae parrot behavioral patterns. PO exhibits effective optimization capabilities by achieving equilibrium between exploration and exploitation phases…
David R. Penas, Meysam Hashemi, Viktor K. Jirsa, Julio R. Banga
The Virtual Epileptic Patient (VEP) refers to a computer-based representation of a patient with epilepsy that combines personalized anatomical data with dynamical models of abnormal brain activities. It is capable of generating spatio-temporal seizure patterns that resemble those recorded with invasive methods such as…
Stephan Grein, David R. Penas, Daniel Weindl, Polina Lakrisenko + 2 more
Dynamic models are central to the computational life sciences but typically contain unknown parameters that must be inferred from experimental data. High-throughput measurements have made this task increasingly challenging, yielding high-dimensional search spaces and non-convex objectives with many local optima. This…
Mohammad Dehghani, Pavel Trojovský
In this paper, a new optimization algorithm called hybrid leader-based optimization (HLBO) is introduced that is applicable in optimization challenges. The main idea of HLBO is to guide the algorithm population under the guidance of a hybrid leader. The stages of HLBO are modeled mathematically in two phases of…
Riley Hickman, Priyansh Parakh, Austin Cheng, Qianxiang Ai + 3 more
Experiment planning algorithms are a required component of autonomous platforms for scientific discovery. Selecting a suitable optimization algorithm for a novel application is an important yet difficult choice a researcher has to make based on past empirical performance on similar tasks. To facilitate the evaluation…
Changin Oh, Kathleen P. Wilkie
We present the Toroidal Search Algorithm (TSA), a novel population-based metaheuristic optimization method inspired by the topology of a torus. Conventional metaheuristics frequently suffer from boundary stagnation, a phenomenon that severely degrades performance in bounded and high-dimensional search spaces. TSA…
Matías Ezequiel Hernández Rodríguez
This article introduces the Fuzzy Hunter Optimizer (FHO), a novel metaheuristic inspired by L´evy diffuse visibility walk observed in predatory species and even in human behavior during the search for sustenance. To address a constrained optimization problem, we initialize a population of hunters in the search space.…
Omar Alsayyed, Tareq Hamadneh, Hassan Al-Tarawneh, Mohammad Alqudah + 5 more
'Saikat Gochhait' 'Irina Leonova' 'Om Parkash Malik' 'Mohammad Dehghani' 'Huiling Chen'] In this paper, a new bio-inspired metaheuristic algorithm called Giant Armadillo Optimization (GAO) is introduced, which imitates the natural behavior of giant armadillo in the wild. The fundamental inspiration in the design of GAO…
Julius Beneoluchi Odili, A. Noraziah, Basem Alkazemi, M. Zarina
This paper presents the data description of the African buffalo optimization algorithm (ABO). ABO is a recently-designed optimization algorithm that is inspired by the migrant behaviour of African buffalos in the vast African landscape. Organizing their large herds that could be over a thousand buffalos using just two…
Authors not listed
Solving optimization problems, especially for nonlinear and constrained systems, is a challenge. Decades of specialized algorithms have been developed for general and special cases of root finding, minimization (including constraints), for parameter estimation, and mapping connected spaces. These approaches typically…
Sowmya Ravichandran, Premkumar Manoharan, Pradeep Jangir, Shitharth Selvarajan
The primary objective of this study is to delve into the application and validation of the Resistance Capacitance Optimization Algorithm (RCOA)-a new, physics-inspired metaheuristic optimization algorithm. The RCOA, intriguingly inspired by the time response of a resistance-capacitance circuit to a sudden voltage…
Akhil Shajan, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open- source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
Ahmed, Aram M., Hassan, Bryar A. + 10 more
This paper presents a multi-objective version of the Cat Swarm Optimization Algorithm called the Grid-based Multiobjective Cat Swarm Optimization Algorithm (GMOCSO). Convergence and diversity preservation are the two main goals pursued by modern multi-objective algorithms to yield robust results. To achieve these…
Waqar Younas, Gauhar Ali, Naveed Ahmad, Qamar Abbas + 6 more
'Muhammad Talha Masood' 'Asim Munir' 'Mohammed ElAffendi' 'Shah Nazir' 'Habib Ullah Khan' 'Iván García-Magariño'] Metaheuristic algorithms are effectively used in searching some optical solution space. for optical solution. It is basically the type of local search generalization that can provide useful solutions for…