Engineering (engineering design, digital design)
BackCahiers du GERAD
225 results — page 3 of 12
In this paper, we investigate the problem of system identification for autonomous Markov jump linear systems (MJS) with complete state observations. We prop...
BibTeX reference
This paper presents \(\texttt{Krylov.jl}\)
, a Julia package that implements a collection of Krylov processes and methods for solving a variety of linear pr...
In multi-robot missions, relative position and attitude information between robots is valuable for a variety of tasks such as mapping, planning, and formatio...
BibTeX reference
This note provides a counterexample to a theorem announced in the last part of the paper Analysis of direct searches for discontinuous functions, Mathemati...
BibTeX reference
Motivated by our collaboration with one of the largest fast-fashion retailers in Europe, we study a two-echelon inventory control problem called the One-Ware...
BibTeX reference
This paper presents PDENLPModels.jl a new Julia package for modeling and discretizing optimization problems with mixed algebraic and partial differential equ...
BibTeX reference
Providing the right data to a machine learning model is an important step to insure the performance of the model. Non-compliant training data instances may l...
BibTeX referenceOn GSOR, the generalized successive overrelaxation method for double saddle-point problems
We consider the generalized successive overrelaxation (GSOR) method for solving a class of block three-by-three saddle-point problems. Based on the necessary...
BibTeX referenceOptimal localizability criterion for positioning with distance-deteriorated relative measurements
Position estimation in Multi-Robot Systems (MRS) relies on relative angle or distance measurements between the robots, which generally deteriorate as dista...
BibTeX reference
We consider the problem of training a deep neural network with nonsmooth regularization to retrieve a sparse and efficient sub-structure. Our regularizer is ...
BibTeX reference
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous sem...
BibTeX referenceComputing a sparse projection into a box
We describe a procedure to compute a projection of \(w \in ℝ^n\)
into the intersection of the so-called zero-norm ball \(k B_0\)
of radius \(k\)
, i....
DCISolver.jl: A Julia solver for nonlinear optimization using dynamic control of infeasibility
This paper presents DCISolver.jl a new Julia package implementating the Dynamic Control of Infeasibility method (DCI), introduced by Bielschowsky & Gomes (20...
BibTeX referenceDétection de communautés dynamiques dans les réseaux évolutifs de développeurs au sein de Chrome
The time-stamped database provided by Google traces the code contributions to Chrome browser on the period from September 2008 to January 2014. It describes ...
BibTeX reference
In blackbox optimization, evaluation of the objective and constraint functions is time consuming. In some situations, constraint values may be evaluated in...
BibTeX referenceA derivative-free approach to optimal control problems with a piecewise constant Mayer cost function
A piecewise constant Mayer cost function is used to model optimal control problems in which the state space is partitioned into several regions, each having ...
BibTeX reference
We introduce an iterative method named GPMR for solving 2X2 block unsymmetric linear systems. GPMR is based on a new process that reduces simultaneously...
BibTeX reference
This paper presents an efficient method for extracting the second-order sensitivities from a system of implicit nonlinear equations. We design a custom aut...
BibTeX reference
For a simple connected graph \(G\)
, let \(D(G), ~Tr(G)\)
, \(D^{L}(G)=Tr(G)-D(G)\)
, and \(D^{Q}(G)=Tr(G)+D(G)\)
be the distance matrix, the diagonal m...
In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-orde...
BibTeX reference