229 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université Fédérale de Toulouse Midi-PyrénéesFR19 papers
- Centre National de la Recherche ScientifiqueFR17 papers
- Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO)FR15 papers
- Université Toulouse III - Paul SabatierFR8 papers
- École Nationale de l’Aviation CivileFR6 papers
- Office National d'Études et de Recherches AérospatialesFR5 papers
- Université Paris-SaclayFR5 papers
- Institut Clément AderFR4 papers
- Institut de Recherche en Astrophysique et PlanétologieFR4 papers
- Polytechnique MontréalCA4 papers
- Université de ToulouseFR4 papers
- Astrophysique, Instrumentation et ModélisationFR3 papers
5 papers · 1 filter
A Subsampling Line-Search Method with Second-Order Results
El-houcine Bergou, Youssef Diouane, Vladimir Kunc +2
In many contemporary optimization problems such as those arising in machine learning, it can be computationally challenging or even infeasible to evaluate an entire function or its…
Height and contour processes of Crump-Mode-Jagers forests (II): The Bellman-Harris universality class
E. Schertzer, F. Simatos
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In…
A stochastic Levenberg-Marquardt method using random models with complexity results
E. Bergou, Y. Diouane, V. Kungurtsev +1
Globally convergent variants of the Gauss-Newton algorithm are often the methods of choice to tackle nonlinear least-squares problems. Among such frameworks, Levenberg-Marquardt an…
A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis
El houcine Bergou, Youssef Diouane, Serge Gratton
Adaptive regularized framework using cubics has emerged as an alternative to line-search and trust-region algorithms for smooth nonconvex optimization, with an optimal complexity a…
Open Loop Execution of Tree-Search Algorithms, extended version
Erwan Lecarpentier, Guillaume Infantes, Charles Lesire +1
In the context of tree-search stochastic planning algorithms where a generative model is available, we consider on-line planning algorithms building trees in order to recommend an…