14 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…
Carsten Gottschlich, Dominic Schuhmacher, Haipeng Peng
Using the simplex approach the transportation algorithm consists of two stages: first, an initial transportation plan is constructed such that (2-1)$Equations (2$-(2-2)$4$) are satisfied. Second, the initial plan is iteratively improved until the optimal solution is obtained. At any time the current feasible plan…
Kalpanarani K., Hannah Grace G.
Introduction In unsupervised learning, data clustering is essential. However, many current algorithms have issues like early convergence, inadequate local search capabilities, and trouble processing complicated or unbalanced input. Established methods like Kmeans are still widely used because of their ease of use…
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…
Kirill Kukharenko, Laura Sanità
The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key…
Hassan Musafer, Emre Tokgoz, Ausif Mahmood, Jingbo Wang
This article provides a new tool for examining the efficiency and robustness of derivative-free optimization algorithms based on high-dimensional normalized data profiles that test a variety of performance metrics. Unlike the traditional data profiles that examine a single dimension, the proposed data profiles require…
Ritchie Lee, Susmit Jha, Anastasia Mavridou, Dimitra Giannakopoulou + 4 more
'Ralph Bottesch' 'Max W. Haslbeck' 'Alban Reynaud' 'René Thiemann'] We implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL. We further integrate this procedure into one application, namely into CeTA, a formally verified certifier to check untrusted…
Navneet Khanna, Jay Airao, Munish Kumar Gupta, Qinghua Song + 4 more
'Zhanqiang Liu' 'Mozammel Mia' 'Radoslaw Maruda' 'Grzegorz Krolczyk'] These days, power consumption and energy related issues are very hot topics of research especially for machine tooling process industries because of the strict environmental regulations and policies. Hence, the present paper discusses the application…
Cliff C. Kerr, Salvador Dura-Bernal, Tomasz G. Smolinski, George L. Chadderdon + 2 more
'George L. Chadderdon' 'David P. Wilson' 'Lars Kaderali'] When standard optimization methods fail to find a satisfactory solution for a parameter fitting problem, a tempting recourse is to adjust parameters manually. While tedious, this approach can be surprisingly powerful in terms of achieving optimal or near-optimal…
Jan Schröder, Yair Censor, Philipp Süss, Karl-Heinz Küfer
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at finding a point that fulfills the constraints and has the minimal value of the…