Tighter bound functions for nonconvex functions over simplexes
Mohand Ouanès
Abstract
Open-access reader
Mohand Ouanès
Abstract
Open-access reader
In this paper, we propose new lower and upper bound functions which can be used in computing a range of nonconvex functions over simplexes of Rn, or for solving global optimization problems over simplexes. We show that the new bounding functions are tighter than the classical bounding functions developed in the αBB method and the QBB method.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose new lower and upper bound functions which can be used in computing a range of nonconvex functions over simplexes of Rn, or for solving global optimization problems over simplexes. We show that the new bounding functions are tighter than the classical bounding functions developed in the αBB method and the QBB method.
Key concepts: Bounding overwatch, Simplex, Upper and lower bounds, Mathematical optimization, Mathematics, Range (aeronautics), Simplex algorithm, Computer science