# Engineering (engineering design, digital design)

Back## Cahiers du GERAD

### 214 results — page 7 of 11

Projected Krylov methods are full-space formulations of Krylov methods that take place in a nullspace. Provided projections into the nullspace can be compute...

BibTeX referenceA Variance-Based Method to Rank Input Variables of the Mesh Adaptive Direct Search Algorithm

The Mesh Adaptive Direct Search algorithm (MADS) algorithm is designed for nonsmooth blackbox optimization problems in which the evaluation of the funct...

BibTeX reference

Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequ...

BibTeX reference

Blackbox optimization typically arises when the functions defining the objective and constraints of an optimization problem are computed through a computer...

BibTeX reference

The Mesh Adaptive Direct Search (MADS) class of algorithms is designed for nonsmooth optimization, where the objective function and constraints are typical...

BibTeX reference

This paper presents a framework to determine optimal maintenance planning of a fleet of complex and independent systems. They are made up of several major co...

BibTeX reference

Interior-point methods in semi-definite programming (SDP) require the solution of a sequence of linear systems which are used to derive the search directions...

BibTeX referenceOptimization of Algorithms with OPAL

OPAL is a general-purpose system for modeling and solving algorithm optimization problems. OPAL takes an algorithm as input, and as output it suggests para...

BibTeX reference

Implementations of the Simplex method differ only in very specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer ...

BibTeX reference

The analytic center cutting plane method and its proximal variant are well known techniques for solving convex programming problems. We propose two seq...

BibTeX reference

We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nonde...

BibTeX reference

In this article we address the model order reduction problem for resistor networks by using methods from graph theory. We formulate this problem through gr...

BibTeX reference

We propose an interior-point algorithm based on an elastic formulation of the `\(\ell_1\)`

-penalty merit function for mathematical programs with complementar...

Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear ...

BibTeX reference

Parameterizing source code for architecture-bound optimization is a common approach to high-performance programming but one that makes the programmer's task ...

BibTeX reference

Accurate measurements of snow water equivalent (SWE) is an important factor in managing water resources for hydroelectric power generation. SWE over a catchm...

BibTeX reference

We propose a modified primal-dual interior-point method for nonlinear programming that relaxes the requirement of closely following the central path and lend...

BibTeX reference

During alloy and process design, it is often desired to identify regions of design or process variables for which certain calculated functions have optimal v...

BibTeX reference

The present paper describes the coupling of the Mesh Adaptive Direct Search (MADS) algorithm with the FactSage thermochemical software, which allows to calcu...

BibTeX reference

The paper proposes a framework for sensitivity analyses of blackbox constrained optimization problems for which Lagrange multipliers are not available. Two s...

BibTeX reference