default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMounir Haddou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j16]Samir Adly, Mounir Haddou, Manh Hung Le:
Interior point methods for solving Pareto eigenvalue complementarity problems. Optim. Methods Softw. 38(3): 543-569 (2023)- [i2]Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia, Valérie Garès, Mounir Haddou, Quang-Huy Tran:
Analysis and Comparison of Two-Level KFAC Methods for Training Deep Neural Networks. CoRR abs/2303.18083 (2023) - 2022
- [j15]Wassim Hamidouche
, Pierrick Philippe, Sid Ahmed Fezza, Mounir Haddou, Fernando Pescador, Daniel Ménard:
Hardware-Friendly Multiple Transform Selection Module for the VVC Standard. IEEE Trans. Consumer Electron. 68(2): 96-106 (2022) - [i1]Abdoulaye Koroko, Ani Anciaux-Sedrakian, Ibtihel Ben Gharbia, Valérie Garès, Mounir Haddou, Quang-Huy Tran:
Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition. CoRR abs/2201.10285 (2022) - 2021
- [j14]Duc Thach Son Vu, Ibtihel Ben Gharbia, Mounir Haddou, Quang-Huy Tran:
A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems. Math. Comput. Simul. 190: 1243-1274 (2021) - 2020
- [j13]Jean-Pierre Dussault, Mounir Haddou, Abdeslam Kadrani, Tangi Migot:
On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints. J. Optim. Theory Appl. 186(2): 504-522 (2020) - [j12]Mounir Haddou, Tangi Migot:
A smoothing method for sparse optimization over convex sets. Optim. Lett. 14(5): 1053-1069 (2020)
2010 – 2019
- 2019
- [j11]Lina Abdallah, Mounir Haddou, Tangi Migot:
A sub-additive DC approach to the complementarity problem. Comput. Optim. Appl. 73(2): 509-534 (2019) - [j10]Mounir Haddou, Tangi Migot, Jérémy Omer:
A generalized direction in interior point method for monotone linear complementarity problems. Optim. Lett. 13(1): 35-53 (2019) - [c3]Lina Abdallah, Tangi Migot, Mounir Haddou:
Solving Mathematical Programs with Complementarity Constraints with a Penalization Approach. WCGO 2019: 228-237 - 2018
- [j9]Lina Abdallah, Mounir Haddou, Tangi Migot:
Solving absolute value equation using complementarity and smoothing functions. J. Comput. Appl. Math. 327: 196-207 (2018) - [c2]Tangi Migot, Lina Abdallah, Mounir Haddou:
A Sub-Additive Merit Function for Complementarity Problems and Application. LOPAL 2018: 11:1-11:5 - 2015
- [c1]Tangi Migot, Mounir Haddou:
A Smoothing Method for Sparse Optimization over Polyhedral Sets. MCO (1) 2015: 369-379 - 2014
- [j8]Mounir Haddou, Patrick Maheux:
Smoothing Methods for Nonlinear Complementarity Problems. J. Optim. Theory Appl. 160(3): 711-729 (2014) - 2011
- [j7]Fulgence Nahayo, Salah Khardi, Jean Ndimubandi, Mounir Haddou, Mahmoud Hamadiche:
Two-Aircraft Acoustic Optimal Control Problem: SQP algorithms. ARIMA J. 14: 7 (2011)
2000 – 2009
- 2006
- [j6]Maïtine Bergounioux, Mounir Haddou:
A regularization method for ill-posed bilevel optimization problems. RAIRO Oper. Res. 40(1): 19-35 (2006) - 2000
- [j5]J. Frédéric Bonnans, Mounir Haddou:
Asymptotic Analysis of Congested Communication Networks. Math. Oper. Res. 25(3): 409-426 (2000) - [j4]Maïtine Bergounioux, Mounir Haddou, Michael Hintermüller, Karl Kunisch:
A Comparison of a Moreau-Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems. SIAM J. Optim. 11(2): 495-521 (2000)
1990 – 1999
- 1997
- [j3]Alfred Auslender, Roberto Cominetti, Mounir Haddou:
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming. Math. Oper. Res. 22(1): 43-62 (1997) - 1996
- [j2]Masao Fukushima, Mounir Haddou, Hien Nguyen, Jean-Jacques Strodiot, Takanobu Sugimoto, Eiki Yamakawa:
A parallel descent algorithm for convex programming. Comput. Optim. Appl. 5(1): 5-37 (1996) - 1995
- [j1]Alfred Auslender, Mounir Haddou:
An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities. Math. Program. 71: 77-100 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
