 | Monter d'un niveau |
Anagnostidis, S.-K., Lucchi, A., & Diouane, Y. (avril 2021). Direct-Search for a Class of Stochastic Min-Max Problems [Communication écrite]. 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021). Lien externe
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. Lien externe
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. Lien externe
Custódio, A. L., Diouane, Y., Garmanjani, R., & Riccietti, E. (2021). Worst-Case Complexity Bounds of Directional Direct-Search Methods for Multiobjective Optimization. Journal of Optimization Theory and Applications, 188(1), 73-93. Lien externe
Diouane, Y. (2021). Contribution to numerical optimization with application to engineering problems [Habilitation à diriger, INP Toulouse]. Non disponible
Diouane, Y. (2021). A merit function approach for evolution strategies. EURO Journal on Computational Optimization, 9, 100001 (13 pages). Lien externe
Karabaş, U., Diouane, Y., & Douvenot, R. (mars 2021). A Multiscale Parametrization for Refractivity Estimation in the Troposphere [Communication écrite]. 15th European Conference on Antennas and Propagation (EuCAP 2021), Dusseldorf, Germany (5 pages). Lien externe
Karabaş, U., Diouane, Y., & Douvenot, R. (2021). A Variational Adjoint Approach on Wide-Angle Parabolic Equation for Refractivity Inversion. IEEE Transactions on Antennas and Propagation, 69(8), 4861-4870. Lien externe
Saves, P., Bartoli, N., Diouane, Y., Lefebvre, T., Morlier, J., David, C., Van, E., & Defoort, S. (juillet 2021). Constrained Bayesian Optimization Over Mixed Categorical Variables, With Application to Aircraft Design [Communication écrite]. AeroBest 2021, Lisbonne, Portugal. Lien externe
