Charles Audet
BackCahiers du GERAD
134 results — page 5 of 7
This work analyzes constrained black box optimization in which the functions defining the problem are periodic with respect to some or all the variables. We ...
BibTeX reference
This work studies multi-objective optimization <i>(MOP)</i> of nonsmooth functions subject to general constraints. We first present definitions and optimalit...
BibTeX reference
A recent paper of Tuy and Hoai-Phuong published in <i>JOGO</i> (2007) 37:557--569 observes that there are errors in the reformulation of a signomial geometr...
BibTeX reference
<p>The class of Mesh Adaptive Direct Search (MADS) algorithms is designed for the optimization of constrained black-box problems. The purpose of this paper i...
BibTeX reference
A polygon is said to be <i>simple</i> if the only points of the plane belonging to two of its edges are its vertices. We answer the question of finding, ...
BibTeX reference
The hexagon and heptagon with unit diameter and maximum sum of Euclidean distances between vertices are determined by enumerating diameter configurations, an...
BibTeX reference
The purpose of this paper is to introduce a new way of choosing directions for the Mesh Adaptive Direct Search (MADS) class of algorithms. The advantages of...
BibTeX reference
We propose a new approach to solve the multi-objective portfolio selection problem in the presence of skewness. The selection of efficient portfolios require...
BibTeX reference
In previous work, bimatrix games were expressed as parametric linear mixed 0-1 programs and the <img src="/cgi-bin/mimetex.cgi?{\rm E}_\chi">MIP algorithm w...
BibTeX reference
Consider a convex polygon <i>V<sub>n</sub></i> with <i>n</i> sides, perimeter <i>P<sub>n</sub></i>, diameter <i>D<sub>n</sub></i>, area <i>A<sub>n</sub></i>...
BibTeX reference
This paper describes a Parallel Space Decomposition (PSD) technique for the Mesh Adaptive Direct Search (MADS) algorithm. MADS extends Generalized Pattern ...
BibTeX reference
In previous work, the generalized pattern search (GPS) algorithm for linearly constrained (continuous) optimization was extended to mixed variable problems...
BibTeX reference
We propose a new algorithm for general constrained derivative-free optimization. As in most methods, constraint violations are aggregated into a single con...
BibTeX referenceNonsmooth Optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
This paper proposes a way to combine the Mesh Adaptive Direct Search (MADS) algorithm, which extends the Generalized Pattern Search (GPS) algorithm, with th...
BibTeX referenceExact L2-Norm Plane Separation
We consider the problem of separating two sets of points in an n-dimensional real space with a (hyper)plane that minimizes the sum of <i>L</i><sub>2</sub>-n...
BibTeX reference
This work deals with bound constrained multiobjective optimization (<i>MOP</i>) of nonsmooth functions for problems in which the structure of the objective ...
BibTeX reference
This paper presents two new results on the enumeration of all extreme equilibria of the sequence form of a two person extensive game. The sequential form of...
BibTeX reference
In this paper, the general problem of chemical process optimization defined by a computer simulation is formulated. It is generally a nonlinear, non-convex,...
BibTeX referenceIsoperimetric Polygons of Maximal Width
The value <img src="/cgi-bin/mimetex.cgi?\frac{1}{2n} \cot\left( \frac{\pi}{2n}\right)"> is shown to be an upper bound on the width of any <i>n</i>-sided p...
BibTeX reference
From the pentagon onwards, the area of the regular convex polygon with <i>n</i> sides and unit diameter is greater for each odd number <i>n</i> than for the...
BibTeX reference