![]() | Up a level |
This graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
A word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Bergou, E. H., Diouane, Y., Kungurtsev, V., & Royer, C. W. (2026). Direct-search methods for decentralized blackbox optimization. Optimization Methods and Software, 22 pages. Restricted access
Bergou, E. H., Diouane, Y., Kungurtsev, V., & Royer, C. W. (2022). A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results. SIAM/ASA Journal on Uncertainty Quantification, 10(1), 507-536. External link
Bergou, E. H., Diouane, Y., Kunc, V., Kungurtsev, V., & Royer, C. W. (2022). A subsampling line-search method with second-order results. INFORMS Journal on Optimization, 4(4), 403-425. External link
Bergou, E.-H., Diouane, Y., & Kungurtsev, V. (2021). Complexity iteration analysis for strongly convex multi-objective optimization using a Newton path-following procedure. Optimization Letters, 15(4), 1215-1227. External link
Bergou, E. H., Diouane, Y., Kungurtsev, V., & Royer, C. W. (2021). A Nonmonotone Matrix-Free Algorithm for Nonlinear Equality-Constrained Least-Squares Problems. SIAM Journal on Scientific Computing, 43(5), S743-S766. External link
Bergou, E. H., Diouane, Y., & Kungurtsev, V. (2020). Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems. Journal of Optimization Theory and Applications, 185(3), 927-944. External link
Diouane, Y., Bergou, E. H., Kungurtsev, V., & Royer, C. W. (2024, July). A direct-search method for decentralized derivative-free optimization [Abstract]. 25th International Symposium on Mathematical Programming (ISMP 2024), Montréal, QC, Canada. External link
Diouane, Y., Kungurtsev, V., Rinaldi, F., & Zeffiro, D. (2024). Inexact direct-search methods for bilevel optimization problems. Computational Optimization and Applications, 22-22. Available