Christophe Tribes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christophe Tribes has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Charles Audet
GERAD and Département de Mathématiques et Génie Industriel, École Polytechnique de Montréal, Montreal, Canada
12 shared publications - Sébastien Le Digabel
GERAD and Department of Mathematics and Industrial Engineering Polytechnique Montréal. 6079 Succ. Centre-ville Montréal H3C 3A7 Québec Canada
8 shared publications - Jean-Yves Trépanier
Ecole Polytechnique de Montréal
5 shared publications - Miguel Diago
Hydro-Québec image/svg+xml
2 shared publications - Warren Hare
University of British Columbia
2 shared publications - Youssef Diouane
Department of Mathematical and Industrial Engineering, Polytechnique Montreal, Montreal, Canada
2 shared publications
Latest Publications
- Open Access
- 23 October 2026
- Published by TIB Open Publishing in SolarPACES Conference Proceedings
- Vol. 4
Benchmarking Derivative-Free Optimization Solvers for CSP Plant Design Using the SOLAR Simulator
This work presents a case study where four well-known derivative-free solvers are benchmarked on several instances based on the solar suite of problems: an easy to use, freely available and open-source Concentrated Solar Power (CSP) plant simulator. The solar simulator provides a collection of ten test problems designed to reflect real-world optimization challenges. The design of CSP plants involves solving complex and often computationally expensive optimization problems. These problems rely on highly diverse models which may be difficult to interface with optimization solvers. As a result, standardized benchmark problems for optimization solvers in the CSP design field are scarce. Such benchmarks are essential for selecting the most appropriate solver for a given optimization problem. The solar problems model numerous components of the power plant, ranging from the design of the heliostat field to the choice of turbine.
- 23 October 2026
- Published by TIB Open Publishing in SolarPACES Conference Proceedings
- Vol. 4
Open AccessBenchmarking Derivative-Free Optimization Solvers for CSP Plant Design Using the SOLAR Simulator
This work presents a case study where four well-known derivative-free solvers are benchmarked on several instances based on the solar suite of problems: an easy to use, freely available and open-source Concentrated Solar Power (CSP) plant simulator. The solar simulator provides a collection of ten test problems designed to reflect real-world optimization challenges. The design of CSP plants involves solving complex and often computationally expensive optimization problems. These problems rely on highly diverse models which may be difficult to interface with optimization solvers. As a result, standardized benchmark problems for optimization solvers in the CSP design field are scarce. Such benchmarks are essential for selecting the most appropriate solver for a given optimization problem. The solar problems model numerous components of the power plant, ranging from the design of the heliostat field to the choice of turbine.
- 19 May 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (7) , 1437-1456
A summary of benchmarking constrained, multi-objective and surrogate-assisted optimization methods
- 19 May 2026
- Published by Springer Nature in Optimization Letters
- Vol. 20 (7) , 1437-1456
A summary of benchmarking constrained, multi-objective and surrogate-assisted optimization methods
- Open Access
A penalty-interior point method combined with MADS for equality and inequality constrained optimization
This work introduces MADS-PIP, an efficient framework that integrates a penalty-interior point strategy into the mesh adaptive direct search (MADS) algorithm for solving nonsmooth blackbox optimization problems with general inequality and equality constraints. Inequality constraints are partitioned into two subsets: one treated via a logarithmic barrier applied to an aggregated interior constraint violation, and the other handled through an exterior quadratic penalty. All equality constraints are treated by the exterior penalty. A merit function defines a sequence of unconstrained subproblems, which are solved approximately using MADS, while a carefully designed update rule drives the penalty-barrier parameter to zero. In the nonsmooth setting, we establish convergence results ensuring feasibility for general constraints as well as Clarke stationarity for inequality-constrained problems. Computational experiments on both analytical test sets and challenging blackbox problems demonstrate that the proposed MADS-PIP algorithm is competitive with, and often outperforms, MADS with the progressive barrier strategy, particularly in the presence of equality constraints.
Open AccessA penalty-interior point method combined with MADS for equality and inequality constrained optimization
This work introduces MADS-PIP, an efficient framework that integrates a penalty-interior point strategy into the mesh adaptive direct search (MADS) algorithm for solving nonsmooth blackbox optimization problems with general inequality and equality constraints. Inequality constraints are partitioned into two subsets: one treated via a logarithmic barrier applied to an aggregated interior constraint violation, and the other handled through an exterior quadratic penalty. All equality constraints are treated by the exterior penalty. A merit function defines a sequence of unconstrained subproblems, which are solved approximately using MADS, while a carefully designed update rule drives the penalty-barrier parameter to zero. In the nonsmooth setting, we establish convergence results ensuring feasibility for general constraints as well as Clarke stationarity for inequality-constrained problems. Computational experiments on both analytical test sets and challenging blackbox problems demonstrate that the proposed MADS-PIP algorithm is competitive with, and often outperforms, MADS with the progressive barrier strategy, particularly in the presence of equality constraints.
- Open Access
Adaptive direct search algorithms for constrained optimization
Two families of directional direct search methods have emerged in derivative-free and blackbox optimization (DFO and BBO), each based on distinct principles: Mesh Adaptive Direct Search (MADS) and Sufficient Decrease Direct Search (SDDS). MADS restricts trial points to a mesh and accepts any improvement, ensuring none are missed, but at the cost of restraining the placement of trial points. SDDS allows greater freedom by evaluating points anywhere in the space, but accepts only those yielding a sufficient decrease in the objective function value, which may lead to discarding improving points. This work introduces a new class of methods, Adaptive Direct Search (ADS), which uses a novel acceptance rule based on the so-called punctured space, avoiding both meshes and sufficient decrease conditions. ADS enables flexible search while addressing the limitations of MADS and SDDS, and retains the theoretical foundations of directional direct search. Computational results in constrained and unconstrained settings highlight its performance compared to both MADS and SDDS.
Open AccessAdaptive direct search algorithms for constrained optimization
Two families of directional direct search methods have emerged in derivative-free and blackbox optimization (DFO and BBO), each based on distinct principles: Mesh Adaptive Direct Search (MADS) and Sufficient Decrease Direct Search (SDDS). MADS restricts trial points to a mesh and accepts any improvement, ensuring none are missed, but at the cost of restraining the placement of trial points. SDDS allows greater freedom by evaluating points anywhere in the space, but accepts only those yielding a sufficient decrease in the objective function value, which may lead to discarding improving points. This work introduces a new class of methods, Adaptive Direct Search (ADS), which uses a novel acceptance rule based on the so-called punctured space, avoiding both meshes and sufficient decrease conditions. ADS enables flexible search while addressing the limitations of MADS and SDDS, and retains the theoretical foundations of directional direct search. Computational results in constrained and unconstrained settings highlight its performance compared to both MADS and SDDS.
- Open Access
- 30 May 2025
- Published by Springer Nature in Research Square
Benchmarking constrained, multi-objective and surrogate-assisted derivative-free optimization methods
Benchmarking is essential for assessing the effectiveness of optimization algorithms. This is especially true in derivative-free optimization, where target problems are often complex simulations that require extensive time to evaluate.This limits the number of evaluations that can be performed, making it critical to have a good understanding of the potential quality of various algorithms. This paper reviews standard benchmarking methods, including convergence plots, performance profiles, data profiles, and accuracy profiles, widely used to evaluate optimization algorithms. The primary contribution of this work is a formal extension of these benchmarking techniques to three specific contexts: constrained optimization, multi-objective optimization, and surrogate-based optimization. AMS subject classifications: primary 90-05, 90C56; secondary 90C29, 90-10
- 30 May 2025
- Published by Springer Nature in Research Square
Open AccessBenchmarking constrained, multi-objective and surrogate-assisted derivative-free optimization methods
Benchmarking is essential for assessing the effectiveness of optimization algorithms. This is especially true in derivative-free optimization, where target problems are often complex simulations that require extensive time to evaluate.This limits the number of evaluations that can be performed, making it critical to have a good understanding of the potential quality of various algorithms. This paper reviews standard benchmarking methods, including convergence plots, performance profiles, data profiles, and accuracy profiles, widely used to evaluate optimization algorithms. The primary contribution of this work is a formal extension of these benchmarking techniques to three specific contexts: constrained optimization, multi-objective optimization, and surrogate-based optimization. AMS subject classifications: primary 90-05, 90C56; secondary 90C29, 90-10
- 1 March 2025
- Published by Springer Nature in Optimization and Engineering
- p. 1-47
Solar: a solar thermal power plant simulator for blackbox optimization benchmarking
- 1 March 2025
- Published by Springer Nature in Optimization and Engineering
- p. 1-47
Solar: a solar thermal power plant simulator for blackbox optimization benchmarking
- Open Access
Hyperparameter Optimization for Large Language Model Instruction-Tuning
The fine-tuning of Large Language Models (LLMs) has enabled them to recently achieve milestones in natural language processing applications. The emergence of ever larger LLMs has paved the way for more efficient fine-tuning methods. Among these, the Low-Rank Adaptation (LoRA) method keeps most of the weights of the pre-trained LLM frozen while introducing a low-rank decomposition of the weight matrix, enabling the tuning of only a very small proportion of the network. The performance on downstream tasks of models fine-tuned with LoRA heavily relies on a set of hyperparameters including the rank of the decomposition. In this work, we investigate the choice of these hyperparameters through two main blackbox optimization (BBO) techniques. We examine the whole pipeline of performing fine-tuning and validation on a pre-trained LLM as a blackbox and efficiently explore the space of hyperparameters with the \nomad algorithm, achieving a boost in performance and human alignment of the tuned model.
Open AccessHyperparameter Optimization for Large Language Model Instruction-Tuning
The fine-tuning of Large Language Models (LLMs) has enabled them to recently achieve milestones in natural language processing applications. The emergence of ever larger LLMs has paved the way for more efficient fine-tuning methods. Among these, the Low-Rank Adaptation (LoRA) method keeps most of the weights of the pre-trained LLM frozen while introducing a low-rank decomposition of the weight matrix, enabling the tuning of only a very small proportion of the network. The performance on downstream tasks of models fine-tuned with LoRA heavily relies on a set of hyperparameters including the rank of the decomposition. In this work, we investigate the choice of these hyperparameters through two main blackbox optimization (BBO) techniques. We examine the whole pipeline of performing fine-tuning and validation on a pre-trained LLM as a blackbox and efficiently explore the space of hyperparameters with the \nomad algorithm, achieving a boost in performance and human alignment of the tuned model.
- Open Access
Scaling Deep Networks with the Mesh Adaptive Direct Search algorithm
Deep neural networks are getting larger. Their implementation on edge and IoT devices becomes more challenging and moved the community to design lighter versions with similar performance. Standard automatic design tools such as \emph{reinforcement learning} and \emph{evolutionary computing} fundamentally rely on cheap evaluations of an objective function. In the neural network design context, this objective is the accuracy after training, which is expensive and time-consuming to evaluate. We automate the design of a light deep neural network for image classification using the \emph{Mesh Adaptive Direct Search}(MADS) algorithm, a mature derivative-free optimization method that effectively accounts for the expensive blackbox nature of the objective function to explore the design space, even in the presence of constraints.Our tests show competitive compression rates with reduced numbers of trials.
Open AccessScaling Deep Networks with the Mesh Adaptive Direct Search algorithm
Deep neural networks are getting larger. Their implementation on edge and IoT devices becomes more challenging and moved the community to design lighter versions with similar performance. Standard automatic design tools such as \emph{reinforcement learning} and \emph{evolutionary computing} fundamentally rely on cheap evaluations of an objective function. In the neural network design context, this objective is the accuracy after training, which is expensive and time-consuming to evaluate. We automate the design of a light deep neural network for image classification using the \emph{Mesh Adaptive Direct Search}(MADS) algorithm, a mature derivative-free optimization method that effectively accounts for the expensive blackbox nature of the objective function to explore the design space, even in the presence of constraints.Our tests show competitive compression rates with reduced numbers of trials.
- Top Cited PapersOpen Access
- 10 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 48 (3) , 1-22
Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
NOMAD is a state-of-the-art software package for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD , version 3, dates to 2008. Minor releases are produced as new features are incorporated. The present work describes NOMAD 4, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities, and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the MegaSearchPoll component, warm and hot restarts, and a revised version of the PsdMads algorithm. Another main improvement of NOMAD 4 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization are simpler than before, while overall optimization performance is maintained between versions 3 and 4. NOMAD is freely available at www.gerad.ca/nomad and the whole project is visible at github.com/bbopt/nomad.
- 10 September 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 48 (3) , 1-22
Top Cited PapersOpen AccessAlgorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
NOMAD is a state-of-the-art software package for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD , version 3, dates to 2008. Minor releases are produced as new features are incorporated. The present work describes NOMAD 4, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities, and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the MegaSearchPoll component, warm and hot restarts, and a revised version of the PsdMads algorithm. Another main improvement of NOMAD 4 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization are simpler than before, while overall optimization performance is maintained between versions 3 and 4. NOMAD is freely available at www.gerad.ca/nomad and the whole project is visible at github.com/bbopt/nomad.
- Open Access
NOMAD version 4: Nonlinear optimization with the MADS algorithm
NOMAD is software for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD, version 3, dates from 2008. Minor releases are produced as new features are incorporated. The present work describes NOMAD 4, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms, and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the MegaSearchPoll component, warm and hot restarts, and a revised version of the PSD-MADS algorithm. Another main improvement of NOMAD 4 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations, and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization is simpler than before, while overall optimization performance is maintained between versions 3 and 4. NOMAD is freely available at www.gerad.ca/nomad and the whole project is visible at github.com/bbopt/nomad.
Open AccessNOMAD version 4: Nonlinear optimization with the MADS algorithm
NOMAD is software for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD, version 3, dates from 2008. Minor releases are produced as new features are incorporated. The present work describes NOMAD 4, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms, and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the MegaSearchPoll component, warm and hot restarts, and a revised version of the PSD-MADS algorithm. Another main improvement of NOMAD 4 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations, and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization is simpler than before, while overall optimization performance is maintained between versions 3 and 4. NOMAD is freely available at www.gerad.ca/nomad and the whole project is visible at github.com/bbopt/nomad.