# Engineering (engineering design, digital design)

Back## Cahiers du GERAD

### 216 results — page 6 of 11

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...

In the present paper, we prove lower and upper bounds for each of the ratios `\(GA/\delta\)`

, `\(GA/\overline{d}\)`

and `\(\Delta\)`

, 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 referenceUse of a biobjective direct search algorithm in the process design of material science applications

This work describes the application of a direct search method to the optimization of problems of real industrial interest, namely three new material scien...

BibTeX reference

This paper considers a family of cutting planes, recently developed for mixed 0-1 polynomial programs and shows that they define facets for the maximum edge-...

BibTeX reference

A new algorithm for the optimal stope design problem is proposed. It is based on a previous methodology developed by Bai et al. (2013a) where a cylindrical ...

BibTeX referenceDecentralized stochastic control

Decentralized stochastic control refers to the multi-stage optimization of a dynamical system by multiple controllers that have access to different informati...

BibTeX reference

In decentralized control systems with linear dynamics, quadratic cost, and Gaussian disturbance (also called decentralized LQG systems) linear control strate...

BibTeX reference

Various constrained problem formulations for the optimization of an electro-thermal wing anti-icing system in both running-wet and evaporative regimes are pr...

BibTeX reference

In many large engineering design problems, it is not computationally feasible or realistic to store Jacobians or Hessians explicitly. Matrix-free implementat...

BibTeX referenceSystem-of-systems approach to air transportation design using nested optimization and direct search

Aircraft sizing, route network design, demand estimation and allocation of aircraft to routes are different facets of the air transportation optimization pro...

BibTeX reference

Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer ...

BibTeX reference

A preconditioned variant of the Golub and Kahan (1965) bidiagonalization process recently proposed by Arioli (2013) and Arioli and Orban (2013) allows us to ...

BibTeX reference

We propose a generalization of the limited-memory Cholesky factorization of Lin and Moré (1999) to the symmetric indefinite case with special interest in sym...

BibTeX reference