Nadia Oudjane

Nadia Oudjane

Auto-generated profile, based on publicly available information

Nadia Oudjane

EDF R&D and FiME (Laboratoire de Finance des Marchés de l'Energie (Dauphine CREST EDF R&D) www.fime-lab.org)

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 April 2023 in Applied Mathematics & Optimization
Verified
Journal Article
Closed access
PDF file
ASAdrien Seguret
Adrien Seguret
CAClemence Alasseur
Clemence Alasseur
JBJ. Frédéric Bonnans
J. Frédéric Bonnans
APAntonio De Paola
Antonio De Paola
NONadia Oudjane
Nadia Oudjane
Vincenzo TrovatoVincenzo Trovato
Vincenzo Trovato

26 January 2018 in Monte Carlo Methods and Applications
Verified
Journal Article
Closed access
PDF file
ACAnthony Le Cavil
Anthony Le Cavil
NONadia Oudjane
Nadia Oudjane
FRFrancesco Russo
Francesco Russo
The paper is devoted to the construction of a probabilistic particle algorithm. This is related to a nonlinear forward Feynman–Kac-type equation, which represents the solution of a nonconservative semilinear parabolic partial differential equation (PDE). Illustrations of the efficiency of the algorithm are provided by numerical experiments.

1 August 2023 in Mathematics of Operations Research
Verified
Journal Article
Closed access
KLKang Liu
Kang Liu
NONadia Oudjane
Nadia Oudjane
CWCheng Wan
Cheng Wan
This paper shows the existence of [ ]-Nash equilibria in n-player noncooperative sum-aggregative games in which the players’ cost functions, depending only on their own action and the average of all players’ actions, are lower semicontinuous in the former, whereas γ-Hölder continuous in the latter. Neither the action sets nor the cost functions need to be convex. For an important class of sum-aggregative games, which includes congestion games with γ equal to one, a gradient-proximal algorithm is used to construct [ ]-Nash equilibria with at most [ ] iterations. These results are applied to a numerical example concerning the demand-side management of an electricity system. The asymptotic performance of the algorithm when n tends to infinity is illustrated.

8 January 2022 in Nonlinear Differential Equations and Applications NoDEA
Verified
Journal Article
Closed access
PDF file
LILucas Izydorczyk
Lucas Izydorczyk
NONadia Oudjane
Nadia Oudjane
FRFrancesco Russo
Francesco Russo
GTGianmario Tessitore
Gianmario Tessitore

21 October 2021 in Monte Carlo Methods and Applications
Verified
Journal Article
Closed access
LILucas Izydorczyk
Lucas Izydorczyk
NONadia Oudjane
Nadia Oudjane
FRFrancesco Russo
Francesco Russo
We propose a fully backward representation of semilinear PDEs with application to stochastic control. Based on this, we develop a fully backward Monte-Carlo scheme allowing to generate the regression grid, backwardly in time, as the value function is computed. This offers two key advantages in terms of computational efficiency and memory. First, the grid is generated adaptively in the areas of interest, and second, there is no need to store the entire grid. The performances of this technique are compared in simulations to the traditional Monte-Carlo forward-backward approach on a control problem of thermostatic loads.

1 December 2019
Verified
Conference Paper
Open access
PJPaulin Jacquot
Paulin Jacquot
OBOlivier Beaude
Olivier Beaude
PBPascal Benchimol
Pascal Benchimol
SGStephane Gaubert
Stephane Gaubert
NONadia Oudjane
Nadia Oudjane
We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly non-convex, cost while satisfying the agents’ constraints. We focus on the practical case of the management of energy consumption flexibilities by the operator of a mi-crogrid. This paper provides a privacy-preserving algorithm that does compute the optimal allocation of resources, avoiding each agent to reveal her private information (constraints and individual solution profile) neither to the central operator nor to a third party. Our method relies on an aggregation procedure: we maintain a global allocation of resources, and gradually disaggregate this allocation to enforce the satisfaction of private constraints, by a protocol involving the generation of polyhedral cuts and secure multiparty computations (SMC). To obtain these cuts, we use an alternate projections method à la Von Neumann, which is implemented locally by each agent, preserving her privacy needs. Our theoretical and numerical results show that the method scales well as the number of agents gets large, and thus can be used to solve the allocation problem in high dimension, while addressing privacy issues.