A novel affine arithmetic method to solve optimal power flow problems with uncertainties
M Pirnia, CA Cañizares… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
An affine arithmetic (AA) method is proposed in this paper to solve the optimal power flow
(OPF) problem with uncertain generation sources. In the AA-based OPF problem, all the …
(OPF) problem with uncertain generation sources. In the AA-based OPF problem, all the …
Global Optimization Based on Contractor Programming: An Overview of the IBEX Library
J Ninin - Mathematical Aspects of Computer and Information …, 2016 - Springer
IBEX is an open-source C++ library for constraint processing over real numbers. It provides
reliable algorithms for handling non-linear constraints. In particular, roundoff errors are also …
reliable algorithms for handling non-linear constraints. In particular, roundoff errors are also …
A contractor based on convex interval taylor
I Araya, G Trombettoni, B Neveu - … on Integration of Artificial Intelligence (AI …, 2012 - Springer
Interval Taylor has been proposed in the sixties by the interval analysis community for
relaxing continuous non-convex constraint systems. However, it generally produces a non …
relaxing continuous non-convex constraint systems. However, it generally produces a non …
The analytic image
JP Havlicek, JW Havlicek… - … of International Conference …, 1997 - ieeexplore.ieee.org
We introduce a novel directional multidimensional Hilbert transform and use it to define the
complex-valued analytic image associated with a real-valued image. The analytic image …
complex-valued analytic image associated with a real-valued image. The analytic image …
Inner regions and interval linearizations for global optimization
Researchers from interval analysis and constraint (logic) programming communities have
studied intervals for their ability to manage infinite solution sets of numerical constraint …
studied intervals for their ability to manage infinite solution sets of numerical constraint …
Upper bounding in inner regions for global optimization under inequality constraints
In deterministic continuous constrained global optimization, upper bounding the objective
function generally resorts to local minimization at several nodes/iterations of the branch and …
function generally resorts to local minimization at several nodes/iterations of the branch and …
Tighter McCormick relaxations through subgradient propagation
J Najman, A Mitsos - Journal of Global Optimization, 2019 - Springer
Tight convex and concave relaxations are of high importance in deterministic global
optimization. We present a method to tighten relaxations obtained by the McCormick …
optimization. We present a method to tighten relaxations obtained by the McCormick …
Vibration-based damage detection with uncertainty quantification by structural identification using nonlinear constraint satisfaction with interval arithmetic
T Kernicky, M Whelan… - Structural Health …, 2019 - journals.sagepub.com
Structural identification has received increased attention over recent years for performance-
based structural assessment and health monitoring. Recently, an approach for formulating …
based structural assessment and health monitoring. Recently, an approach for formulating …
Node selection strategies in interval branch and bound algorithms
We present in this article new strategies for selecting nodes in interval Branch and Bound
algorithms for constrained global optimization. For a minimization problem the standard best …
algorithms for constrained global optimization. For a minimization problem the standard best …
On tightness and anchoring of McCormick and other relaxations
J Najman, A Mitsos - Journal of Global Optimization, 2019 - Springer
We say that a convex relaxation of a function is anchored at a particular point in their
domains if the values of the function and the relaxation at this point are equal. The opposite …
domains if the values of the function and the relaxation at this point are equal. The opposite …