Ingénierie (conception en ingénierie, conception numérique)

Retour

Cahiers du GERAD

212 résultats — page 7 de 11

, et

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

référence BibTeX

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

référence BibTeX

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
et

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

référence BibTeX
, et

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

référence BibTeX
, et

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

référence BibTeX
, , et

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

référence BibTeX
et

We propose an interior-point algorithm based on an elastic formulation of the \(\ell_1\)-penalty merit function for mathematical programs with complementar...

référence BibTeX
et

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

référence BibTeX

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

référence BibTeX
, , , et

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

référence BibTeX
, et

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

référence BibTeX
, , , et

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

référence BibTeX
, , , et

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

référence BibTeX
, et

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

référence BibTeX
et

We propose a new approach to construct adaptive multiscale orthonormal (AMO) bases of R<sup><i>N</i></sup> that provide highly sparse signal representations....

référence BibTeX
, et

A mixed interior/exterior-point method for nonlinear programming is described, that handles constraints by way of an <i>l</i><sub>1</sub>-penalty function. A...

référence BibTeX