4 papers · 1 filter
Fast proximal algorithms for nonsmooth convex optimization
Adam Ouorou
In the lines of our approach in \cite{Ouorou2019}, where we exploit Nesterov fast gradient concept \cite{Nesterov1983} to the Moreau-Yosida regularization of a convex function, we…
Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods
Adam Ouorou
We propose new proximal bundle algorithms for minimizing a nonsmooth convex function. These algorithms are derived from the application of Nesterov fast gradient methods for smooth…
A Lagrange decomposition based Branch and Bound algorithm for the Optimal Mapping of Cloud Virtual Machines
Guanglei Wang, Walid Ben-Ameur, Adam Ouorou
One of the challenges of cloud computing is to optimally and efficiently assign virtual ma- chines to physical machines. The aim of telecommunication operators is to minimize the m…
Multipolar robust optimization
Walid Ben-Ameur, Adam Ouorou, Guanglei Wang +1
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing…