Charles Audet
BackCahiers du GERAD
134 results — page 6 of 7
In [<i>SIAM J. Optim.</i>, 17 (2006), pp. 188–217] Audet and Dennis proposed the class of <i>mesh adaptive direct search algorithms</i> (MADS) for minimizat...
BibTeX reference
This work shows how disjunctive cuts can be generated for a bilevel linear programming problem (<i>BLP</i>) with continuous variables. First, a brief summar...
BibTeX referenceExtremal Problems for Convex Polygons
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 referenceQuatre Petits Octogones
Quel octogone de diamère unité (ou petit octogone) possède la plus grande surface ou le plus grand périmètre? Serait-ce l'octogone régulier? Eh! non, il n'en...
BibTeX reference
This paper is intended not as a survey, but as an introduction to some ideas behind the class of mesh adaptive direct search (MADS) methods. Space limitatio...
BibTeX reference
An alternative definition of the linear bilevel programming problem <i>BLP</i> has recently been proposed by Lu, Shi, and Zhang. This note shows that the pr...
BibTeX reference
A previous analysis of second-order behavior of pattern search algorithms for unconstrained and linearly constrained minimization is extended to the more gen...
BibTeX referenceThe Small Octagon with Longest Perimeter
The convex octagon with unit diameter and maximum perimeter is determined. This answers an open question dating from 1922. The proof uses geometric reasonin...
BibTeX reference
The objectives of this paper are twofold; we first demonstrate the flexibility of the mesh adaptive direct search (MADS) in identifying locally optimal algo...
BibTeX reference
We consider the problem of separating two sets of points in an <i>n</i>-dimensional real space with a (hyper)plane that minimizes the sum of <i>L<sub>p</sub...
BibTeX reference
<p> This paper introduces the Mesh Adaptive Direct Search (MADS) class of algorithms for nonlinear optimization. MADS extends the Generalized Pattern Searc...
BibTeX reference
A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. This class combines and extends the Audet-De...
BibTeX reference
Linear mixed 0-1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (<i>BLP</i>) problems. We exploit the...
BibTeX reference
Bimatrix and polymatrix games are expressed as parametric linear 0-1 programs. This leads to an algorithm for complete enumeration of their extreme equilibri...
BibTeX reference
Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus...
BibTeX referenceThe Minimum Diameter Octagon with Unit-Length Sides: Vincze's Wife's Octagon is Suboptimal
This paper answers a query of S. Vincze (Acta Univ. Szeged, Sect. Sci. Math. 12 A (1950) 136-142): find the convex octagon with unit-length sides and minim...
BibTeX reference
This paper formulates and analyzes a pattern search method for general constrained optimization based on filter methods for step acceptance. Roughly, a f...
BibTeX reference
Cet article propose un modèle d’optimisation des stratégies de maintenance pour une meilleure intégration dans un plan de production préétabli. Le modèle est...
BibTeX reference
We present an exact algorithm and three applications of nonconvex quadratically constrained quadratic programming. First, we consider the pooling problem fro...
BibTeX reference
The convergence theory of generalized pattern search algorithms for unconstrained optimization guarantees under mild conditions that the method produces a li...
BibTeX reference