Engineering (engineering design, digital design)

Back

Cahiers du GERAD

251 results — page 3 of 13

, , , , , , , and

This work introduces solar, a collection of ten optimization problem instances for benchmarking blackbox optimization solvers. The instances present differ...

BibTeX reference
, , , and

Randomized algorithms have proven to perform well on a large class of numerical linear algebra problems. Their theoretical analysis is critical to provide gu...

BibTeX reference
, , , and

Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution...

BibTeX reference
, , , and

The purpose of the present note is to bring clarifications to certain concepts and surrounding notation of Aravkin et al. (2022). All results therein contin...

BibTeX reference
, , and

We develop a trust-region method for minimizing the sum of a smooth term \(f\) and a nonsmooth term \(h\), both of which can be nonconvex. Each iteratio...

BibTeX reference
and

We develop an interior-point method for nonsmooth regularized bound-constrained optimization problems. Our method consists of iteratively solving a sequence...

BibTeX reference
, , , and

The fine-tuning of Large Language Models (LLMs) has enabled them to recently achieve milestones in natural language processing applications. The emergenc...

BibTeX reference
, , and

The cosine measure was introduced in 2003 to quantify the richness of a finite positive spanning sets of directions in the context of derivative-free direc...

BibTeX reference
, , , and

A challenge in aircraft design optimization is the presence of non-computable, so-called hidden, constraints that do not return a value in certain regions of...

BibTeX reference
and

In this work, we improve the efficiency of Unit Commitment (UC) optimization solvers using a Graph Convolutional Neural Network (GCNN). In power systems, UC ...

BibTeX reference
, , , and

In this work, we propose a non-intrusive and training free method to detect behind-the-meter (BTM) electric vehicle (EV) charging events from the data measur...

BibTeX reference
, , , and

The Harwell Subroutine Library (HSL) is a renowned suite of efficient and robust numerical algorithms designed to tackle complex mathematical problems such a...

BibTeX reference
, , and

Monte Carlo (MC) is widely used for the simulation of discrete time Markov chains. We consider the case of a \(d\)-dimensional continuous state space and w...

BibTeX reference

This work introduces a novel multi-fidelity blackbox optimization algorithm designed to alleviate the resource-intensive task of evaluating infeasible points...

BibTeX reference

We consider the set of graphs that can be constructed from a one-vertex graph by repeatedly adding a clique or a stable set linked to all or none of the vert...

BibTeX reference

Reinforcement learning (RL) for partially observable Markov decision processes (POMDPs) is a challenging problem because decisions need to be made based on t...

BibTeX reference

This paper addresses risk averse constrained optimization problems where the objective and constraint functions can only be computed by a blackbox subject to...

BibTeX reference
, , , , , , , and

High throughput satellites (HTS), with their digital payload technology, are expected to play a key role as enablers of the upcoming 6G networks. HTS are mai...

BibTeX reference
, , and

Improving neural network optimizer convergence speed is a long-standing priority. Recently, there has been a focus on quasi-Newton optimization methods, whi...

BibTeX reference
, , and

Historically, the training of deep artificial neural networks has relied on parallel computing to achieve practical effectiveness. However, with the increas...

BibTeX reference