Sébastien Le Digabel
Orcid: 0000-0003-3148-5090Affiliations:
- Polytechnique Montréal, Canada
According to our database1,
Sébastien Le Digabel
authored at least 47 papers
between 2004 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on gerad.ca
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Optim. Appl., September, 2024
CoRR, 2024
2023
Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates.
Math. Program., March, 2023
2022
ACM Trans. Math. Softw., 2022
Expert Syst. Appl., 2022
Discret. Optim., 2022
Comput. Optim. Appl., 2022
Constrained blackbox optimization with the NOMAD solver on the COCO constrained test suite.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022
2021
HyperNOMAD: Hyperparameter Optimization of Deep Neural Networks Using Mesh Adaptive Direct Search.
ACM Trans. Math. Softw., 2021
Preface to the special issue of JOGO on the occasion of the 40th anniversary of the Group for Research in Decision Analysis (GERAD).
J. Glob. Optim., 2021
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization.
Comput. Optim. Appl., 2021
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates.
Comput. Optim. Appl., 2021
2020
Preface to the special issue of INFOR on "continuous optimization and applications in machine learning and data analytics".
INFOR Inf. Syst. Oper. Res., 2020
Tuning a variational autoencoder for data accountability problem in the Mars Science Laboratory ground data system.
CoRR, 2020
2019
SIAM J. Optim., 2019
Improving the linear relaxation of maximum <i>k</i>-cut with semidefinite-based constraints.
EURO J. Comput. Optim., 2019
2018
Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm.
Optim. Lett., 2018
Order-based error for managing ensembles of surrogates in mesh adaptive direct search.
J. Glob. Optim., 2018
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm.
Eur. J. Oper. Res., 2018
A progressive barrier derivative-free trust-region algorithm for constrained optimization.
Comput. Optim. Appl., 2018
Ann. Oper. Res., 2018
2016
Technometrics, 2016
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016
Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangian.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
2015
2014
Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms.
SIAM J. Optim., 2014
BMC Bioinform., 2014
2013
Use of quadratic models with mesh-adaptive direct search for constrained black box optimization.
Optim. Methods Softw., 2013
Proceedings of the 17th European Conference on Software Maintenance and Reengineering, 2013
2012
Proceedings of the Search Based Software Engineering - 4th International Symposium, 2012
2011
ACM Trans. Math. Softw., 2011
2010
Exact and heuristic solutions of the global supply chain problem with transfer pricing.
Eur. J. Oper. Res., 2010
2009
SIAM J. Optim., 2009
2008
SIAM J. Optim., 2008
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search.
J. Glob. Optim., 2008
2004