5 papers · ranked by Valyu relevance
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…
Liming Wei, Fengyang Zhang, Vedik Basetti
To accelerate energy efficiency improvement and green transition in industrial parks while addressing energy utilization and carbon reduction requirements, this study proposes a low-carbon economic dispatch model for integrated energy systems (IES) based on an enhanced multi-objective artificial hummingbird algorithm…
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…
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…