23 citations · 29 across the 11 of their papers we have counts for
13 papers
Optimal Control Problem with Mixed Control and State Constraints for Cancer Chemotherapy and Treatment Optimization
David Lassounon, Aziz Belmiloudi, Mounir Haddou
The success of chemotherapy depends on the effectiveness of the drug delivery strategy and its ability to destroy cancer cells while minimizing damage to healthy tissues. The main…
Approximation of an optimal control problem on a network with a perturbed problem in the whole space
Mohamed Camar-Eddine, Mériadec Chuberre, Mounir Haddou +1
A classical optimal control problem posed in the whole space R^2 is perturbed by a singular term of magnitude ^{-1} aimed at driving the trajectories to a prescribed network …
Solving Nonlinear Absolute Value Equations
Aris Daniilidis, Mounir Haddou, Tri Minh Le +2
In this work, we show that several problems naturally represented as Nonlinear Absolute Value Equations (NAVE) can be reformulated as Nonlinear Complementarity Problems (NCP) and e…
Analysis and Comparison of Two-Level KFAC Methods for Training Deep Neural Networks
Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia +3
As a second-order method, the Natural Gradient Descent (NGD) has the ability to accelerate training of neural networks. However, due to the prohibitive computational and memory cos…
A new smoothing method for nonlinear complementarity problems involving P0 function
El Hassene Osmani, Mounir Haddou, Lina Abdallah +1
In this paper, we propose a smoothing method to solve nonlinear complementarity problems involving P 0-functions. We propose a nonparametric algorithm to solve the nonlinear corres…
Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition
Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia +3
Several studies have shown the ability of natural gradient descent to minimize the objective function more efficiently than ordinary gradient descent based methods. However, the bo…
A New Approach for Solving the Linear Complementarity Problem using Smoothing Functions
El Hassene Osmani, Mounir Haddou, Lina Abdallah +1
Based on smoothing techniques, we propose two new methods to solve linear complementarity problems (LCP) called TLCP and Soft-Max. The idea of these two new methods takes inspirati…
A convex function satisfying the Lojasiewicz inequality but failing the gradient conjecture both at zero and infinity
Aris Daniilidis, Mounir Haddou, Olivier Ley
We construct an example of a smooth convex function on the plane with a strict minimum at zero, which is real analytic except at zero, for which Thom's gradient conjecture fails bo…
A new Relaxation Method for Optimal Control of Semilinear Elliptic Variational Inequalities Obstacle Problems
El Hassene Osmani, Mounir Haddou, Naceurdine Bensalem
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle…
Explicit formulas for Glaeser-Whitney extensions of 1-fields in Hilbert spaces
Aris Daniilidis, Mounir Haddou, Erwan Le Gruyer +1
We give a simple alternative proof for the --convex extension problem which has been introduced and studied by D. Azagra and C. Mudarra [2]. As an application, we obtain a…
Optimization of operational aircraft parameters Reducing Noise Emission
Lina Abdallah, Mounir Haddou, Salah Khardi
The objective of this paper is to develop a model and a minimization method to provide flight path optimums reducing aircraft noise in the vicinity of airports. Optimization algori…
A new class of smoothing methods for mathematical programs with equilibrium constraints
Mounir Haddou
A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity con…
A regularization method for ill-posed bilevel optimization problems
Maïtine Bergounioux, Mounir Haddou
We present a regularization method to approach a solution of the pessimistic formulation of ill -posed bilevel problems . This allows to overcome the difficulty arising from the no…