15 papers · ranked by Valyu relevance
Gisela C. V. Ramadas, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes, Fabio Rapallo
'Fabio Rapallo'] This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as ‘erf’, is presented. In the N-M algorithm…
Oliver Serang, Jérémie Bourdon
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a…
Charalampos P. Triantafyllidis, Nikolaos Samaras, Sándor Szénási
This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence of these basic solutions is connected with a sequence of…
Rutinaldo Aguiar Nascimento, Álvaro Barroca Neto, Yuri Shalom de Freitas Bezerra, Hugo Alexandre Dantas do Nascimento + 3 more
'Yuri Shalom de Freitas Bezerra' 'Hugo Alexandre Dantas do Nascimento' 'Liacir dos Santos Lucena' 'Joaquim Elias de Freitas' 'Seyedali Mirjalili'] The FWI is formulated as a nonlinear optimization problem that traditionally uses local (derivative-based) minimization to find the scalar field of properties that best…
Ji Li, Guoqing Hu, Yonghong Zhou, Chong Zou + 3 more
'Jahangir Alam SM' 'Guillermo Villanueva'] As a high performance-cost ratio solution for differential pressure measurement, piezo-resistive differential pressure sensors are widely used in engineering processes. However, their performance is severely affected by the environmental temperature and the static pressure…
Syed Inayatullah, Nasir Touheed, Muhammad Imtiaz, Cheng-Yi Xia
This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting…
Denis Kleverov, Ekaterina Aladyeva, Alexey Serdyukov, Maxim N. Artyomov
Non-negative matrix factorization (NMF) is one of the most powerful linear algebra tools, which has found application in various areas of data analysis, including computational biology. Despite numerous optimization methods devised for NMF, our comprehension of the inherent topological structure within factorizable…
Colin Lynch, Kaitlin Baudier, Douglas Montgomery, Meghan Barrett
Animal nutritionists seek to understand how animals regulate the intake and balance of multiple nutrients, yet the design and analysis of such experiments are often limited by how nutrient spaces are represented. The geometric framework for nutrition (GFN) provides a powerful means to visualize nutrient interactions…
Michael Hutcheon, Andrew Teale
Algorithms are presented for performing a topological analysis of an arbitrary function, evaluated on an arbitrary grid of points. These algorithms work strictly by post-processing the data and require no additional function evaluations. This is achieved by connecting the grid points with a neighbourhood graph…
Qianxiang Ai, Joshua Schrier
In a recent paper in this journal (Chem. Mater. 2022, 34, 2545-2552), Twyman et al. studied the environmental stability of crystals by introducing a greedy heuristic algorithm for determining possible oxidation reactions. We show how the problem can be solved exactly, with less code and comparable computational time by…
Michael W. Reimann, Daniela Egas-Santander
Neuronal connectivity has been characterized at various scales and with respect to various structural aspects. In models of connectivity, it has so far remained difficult to match all of them at once, in particular the higher-order structure appears to be elusive. Here we introduce a new type of graph model that…
Eric Hermes, Khachik Sargsyan, Habib Najm, Judit Zádor
We present a new algorithm for the optimization of molecular structures to saddle points on the potential energy surface using a redundant internal coordinate system. This algorithm automates the procedure of defining the internal coordinate system, including the handling of linear bending angles, e.g. through the…
Prasad U. Bandodkar, Razeen R. Shaikh, Gregory T. Reeves
Model development is essential to gain a mathematical understanding of the underlying phenomena in systems biology. In most models, it is typically hard to estimate the values of the biophysical/phenomenological parameters that characterize the model. The parameters are estimated by minimizing a function that reduces a…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
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…