Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Adam Ouorou"'
Publikováno v:
EURO Journal on Computational Optimization, Vol 6, Iss 4, Pp 395-434 (2018)
We consider linear programs involving uncertain parameters and propose a new tractable robust counterpart which contains and generalizes several other models including the existing Affinely Adjustable Robust Counterpart and the Fully Adjustable Robus
Externí odkaz:
https://doaj.org/article/db2a8344ac1b40e4ab2437a593d34689
Publikováno v:
European Journal of Operational Research. 298:308-321
Preprint submitted to EJOR; We consider a telecommunications company expanding its network capacity to face an increasing demand. The company can also invest in marketing to incentivize clients to shift to more recent technologies, hopefully leading
Publikováno v:
IJCNN
The field of Weakly Supervised Learning (WSL) has recently seen a surge of popularity, with numerous papers addressing different types of "supervision deficiencies". In WSL use cases, a variety of situations exists where the collected "information" i
Publikováno v:
IJCNN
The field of Weakly Supervised Learning (WSL) has recently seen a surge of popularity, with numerous papers addressing different types of "supervision deficiencies", namely: poor quality, non adaptability, and insufficient quantity of labels. Regardi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85b54403ea07e03d9a3d3a3fe6bc0a3c
http://arxiv.org/abs/2010.09621
http://arxiv.org/abs/2010.09621
Autor:
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 devise new proximal algorithms for nonsmooth convex optimization. Thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f553a3cb8072fd9c3df257d756c0458
Publikováno v:
Advanced Computational Methods for Knowledge Engineering ISBN: 9783030383633
ICCSAMA
ICCSAMA
In this paper, we provide an exact reformulation of Nonsmooth Constrained optimization Problems (NCP) using the Moreau-Yosida regularization. This reformulation allows the transformation of (NCP) to a sequence of convex programs of which solutions ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f49d53f83e01b96a69e9dbc95719c448
https://doi.org/10.1007/978-3-030-38364-0_7
https://doi.org/10.1007/978-3-030-38364-0_7
Autor:
Adam Ouorou
Publikováno v:
Networks. 68:200-211
Publikováno v:
29th European Conference on Operational Research
EURO: European Conference on Operational Research
EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain
Networks
Networks, Wiley, 2021, 77 (4), pp.495-519. ⟨10.1002/net.21970⟩
ROADEF 2020
ROADEF 2020, Feb 2020, Paris, France
EURO: European Conference on Operational Research
EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain
Networks
Networks, Wiley, 2021, 77 (4), pp.495-519. ⟨10.1002/net.21970⟩
ROADEF 2020
ROADEF 2020, Feb 2020, Paris, France
International audience; Worldwide telecommunications groups are both infrastructure operator and service provider. Hence, when planning the network expansion, these groups must also consider the subscribers dynamics, which they can influence through
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49e56499b15b7261e02bab0d97e58c4a
https://hal.archives-ouvertes.fr/hal-02189508
https://hal.archives-ouvertes.fr/hal-02189508
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2019, 276 (1), pp.28-39. ⟨10.1016/j.ejor.2018.12.037⟩
European Journal of Operational Research, Elsevier, 2019, 276 (1), pp.28-39. ⟨10.1016/j.ejor.2018.12.037⟩
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 map- ping cost while respecting constraints regarding location, assignm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::242fdf0df7e0c5c4a16955fd89906258
http://arxiv.org/abs/1806.08871
http://arxiv.org/abs/1806.08871
Publikováno v:
Operations Research Letters
Operations Research Letters, Elsevier, 2017, 45 (5), pp.421-426. ⟨10.1016/j.orl.2017.06.008⟩
Operations Research Letters, Elsevier, 2017, 45 (5), pp.421-426. ⟨10.1016/j.orl.2017.06.008⟩
International audience; We discuss two approaches to approximate the convex and concave envelopes of bilinear functions over hypercubes. The first approach is based on a semidefinite program. The second approach considers some predefined cover sets o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03afa843c805618dcd3aeb8c3155ad8d
https://hal.archives-ouvertes.fr/hal-01662836
https://hal.archives-ouvertes.fr/hal-01662836