Engineering (engineering design, digital design)
BackCahiers du GERAD
227 results — page 6 of 12
We consider the solution of derivative-free optimization problems with continuous, integer, discrete and categorical variables in the context of costly black...
BibTeX referenceCCGO: Fast heuristic global optimization
Global optimization problems are very hard to solve, especially when the nonlinear constraints are highly nonconvex, which can result in a large number of di...
BibTeX reference
We study X-ray tomograqphic reconstruction using statistical methods. The problem is expressed in cylindrical coordinates, which yield significant computatio...
BibTeX reference
The particularities of the aircraft parts riveting process simulation necessitate the solution of a large amount of contact problems. We propose a primal-dua...
BibTeX reference
Nanoparticle-based drug delivery is a promising method to increase the therapeutic index of anti-cancer agents with low median toxic dose. The delivery effic...
BibTeX reference
The problem of output stabilization is studied for a class of linear hybrid systems subject to signal uncertainties: linear impulsive systems under dwell-t...
BibTeX reference
This paper proposes a hierarchical decision making model for a coupled planning and operation problem of an advanced microgrid. The proposed model, is formul...
BibTeX reference
In this article we consider a difficult combinatorial optimization problem arising from the operation of a system for testing electronic circuit boards (EC...
BibTeX reference
We propose an iterative method named LSLQ for solving linear least-squares problems Ax≈b
of any shape.
The method is based on the Golub and K...
For pattern-based simulation methods such as SIMPAT, filtersim, wavesim, ect, patterns are stored by scanning a training image with a sliding template. Dimen...
BibTeX reference
Locally weighted regression combines the advantages of polynomial regression and kernel smoothing. We present three ideas for appropriate and effective use...
BibTeX reference
The k
-means is a benchmark algorithm used in cluster analysis. It belongs to the large category of
heuristics based on location-allocation steps that ...
The balanced clustering problem consists of partitioning a set of n
objects into K
equal-sized clusters as long as
n
is a multiple of `(K...
For positive definite linear systems (or semidefinite consistent systems), we use Gauss-Radau quadrature to obtain a cheaply computable upper bound on the ...
BibTeX referenceRobust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm
Blackbox optimization problems are often contaminated with numerical noise, and direct search methods such as the Mesh Adaptive Direct Search (MADS) algorit...
BibTeX reference
NLP.py is a programming environment to model continuous optimization problems and to design computational methods in the high-level and powerful Python l...
BibTeX reference
In the present paper, we prove lower and upper bounds for each of the ratios GA/δ
, GA/¯d
and Δ
, in terms of the order `...
This paper presents a numerical investigation of the non-hierarchical formulation of Analytical Target Cascading (ATC) for coordinating distributed multidisc...
BibTeX reference
This paper proposes a bilevel formulation for a coupled planning and operation problem of an advanced microgrid. The proposed model, recast as a mathematical...
BibTeX referenceA collection of linear systems arising from interior-point methods for quadratic optimization
We describe a collection of linear systems generated during the iterations of an interior-point method for convex quadratic optimization. As the iteration...
BibTeX reference