Charles Audet

Charles Audet

Auto-generated profile, based on publicly available information

Charles Audet

GERAD and Département de Mathématiques et Génie Industriel, École Polytechnique de Montréal, Montreal, Canada

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2002 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
CACharles Audet
Charles Audet
JDJ. E. Dennis
J. E. Dennis
This paper contains a new convergence analysis for the Lewis and Torczon generalized pattern search (GPS) class of methods for unconstrained and linearly constrained optimization. This analysis is motivated by a desire to understand the successful behavior of the algorithm under hypotheses that are satisfied by many practical problems. Specifically, even if the objective function is discontinuous or extended-valued, the methods find a limit point with some minimizing properties. Simple examples show that the strength of the optimality conditions at a limit point depends not only on the algorithm, but also on the directions it uses and on the smoothness of the objective at the limit point in question. The contribution of this paper is to provide a simple convergence analysis that supplies detail about the relation of optimality conditions to objective smoothness properties and to the defining directions for the algorithm, and it gives previous results as corollaries.

11 October 2007 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
CACharles Audet
Charles Audet
VBVincent Béchard
Vincent Béchard
SDSébastien Le Digabel
Sébastien Le Digabel

1 January 2021 in EURO Journal on Computational Optimization
Verified
Journal Article
Open access
SAStéphane Alarie
Stéphane Alarie
CACharles Audet
Charles Audet
AGAïmen E. Gheribi
Aïmen E. Gheribi
MKMichael Kokkolaras
Michael Kokkolaras
SDSébastien Le Digabel
Sébastien Le Digabel

1 January 2008 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
CACharles Audet
Charles Audet
GSGilles Savard
Gilles Savard
WZWalid Zghal
Walid Zghal
This work deals with bound constrained multiobjective optimization (MOP) of nonsmooth functions for problems where the structure of the objective functions either cannot be exploited, or are absent. Typical situations arise when the functions are computed as the result of a computer simulation. We first present definitions and optimality conditions as well as two families of single-objective formulations of MOP. Next, we propose a new algorithm called for the biobjective optimization (BOP) problem (i.e., MOP with two objective functions). The property that Pareto points may be ordered in BOP and not in MOP is exploited by our algorithm. generates an approximation of the Pareto front by solving a series of single-objective formulations of BOP. These single-objective problems are solved using the recent (mesh adaptive direct search) algorithm for nonsmooth optimization. The Pareto front approximation is shown to satisfy some first order necessary optimality conditions based on the Clarke calculus. Finally, is tested on problems from the literature designed to illustrate specific difficulties encountered in biobjective optimization, such as a nonconvex or disjoint Pareto front, local Pareto fronts, or a nonuniform Pareto front.

20 June 2008 in Optimization Letters
Verified
Journal Article
Closed access
PDF file
MAMark A. Abramson
Mark A. Abramson
CACharles Audet
Charles Audet
JCJames W. Chrissis
James W. Chrissis
JWJennifer G. Walston
Jennifer G. Walston

1 June 2004 in Management Science
Verified
Journal Article
Closed access
CACharles Audet
Charles Audet
JBJack Brimberg
Jack Brimberg
PHPierre Hansen
Pierre Hansen
SDSébastien Le Digabel
Sébastien Le Digabel
NMNenad Mladenovic
Nenad Mladenovic
The pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the blended products of the end pools must satisfy given requirements. It is well known that the pooling problem can be modeled through bilinear and nonconvex quadratic programming. In this paper, we investigate how best to apply a new branch-and-cut quadratic programming algorithm to solve the pooling problem. To this effect, we consider two standard models: One is based primarily on flow variables, and the other relies on the proportion of flows entering pools. A hybrid of these two models is proposed for general pooling problems. Comparison of the computational properties of flow and proportion models is made on several problem instances taken from the literature. Moreover, a simple alternating procedure and a variable neighborhood search heuristic are developed to solve large instances and compared with the well-known method of successive linear programming. Solution of difficult test problems from the literature is substantially accelerated, and larger ones are solved exactly or approximately.