An interval branch and bound method for global Robust optimization

In this paper, we design a Branch and Bound algorithm based on interval arithmetic to address nonconvex robust optimization problems. This algorithm provides the exact global solution of such difficult problems arising in many real life applications. A code was developed in MatLab and was used to solve some robust nonconvex problems with few variables. This first numerical study shows the interest of this approach providing the global solution of such difficult robust nonconvex optimization problems.

     

k-Hankel Gabor Transform and Its Applications to the Theory of Localization Operators

Analysis Mathematica - We introduce and study the k-Hankel Gabor transform. We investigate the localization operators for this transform. In particular, we study their trace class properties and we...     

Comparison of different methodologies for the computation of damped nonlinear normal modes and resonance prediction of systems with non-conservative nonlinearities

Nonlinear Dynamics - The nonlinear modes of a non-conservative nonlinear system are sometimes referred to as damped nonlinear normal modes (dNNMs). Because of the non-conservative...