Engineering (engineering design, digital design)

Back

Cahiers du GERAD

217 results — page 1 of 11

, , and

JSOSuite.jl is a new Julia package offering a user-friendly interface for continuous nonlinear optimization. The solvers available cover unconstrained to g...

BibTeX reference
, , and

High penetration of electric vehicle (EV) charging on distribution networks can lead to overloads of key equipment, thereby reducing their usable lifetime. T...

BibTeX reference
, , and

This paper introduces a new step to the Direct Search Method (DSM) to strengthen its convergence analysis. By design, this so-called covering step may e...

BibTeX reference
and

We describe the implementation of RipQP, an interior-point algorithm for convex quadratic optimization. Our Julia implementation is open source, and accommo...

BibTeX reference
, , , , , , , 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

Cellular solids are structures which have applications in mechanical engineering to make lightweight structures and heat exchangers, in biomedical engineer...

BibTeX reference
and

We develop a worst-case evaluation complexity bound for trust-region methods in the presence of unbounded Hessian approximations. We use the algorithm of Ar...

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

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