Charles Audet

dblp:11/4448 · DBLP profile ↗
← Back
17ranked-venue papers
14as first author
5since 2021 · last 2025
0000-0002-3043-5393ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 11 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
YearPublicationVenuePosition
2025 A distance for mixed-variable and hierarchical domains with meta variables
Edward Hallé-Hannan, Charles Audet, Youssef Diouane, Sébastien Le Digabel, Paul Saves
Neurocomputing2
2022 Numerical certification of Pareto optimality for biobjective nonlinear problems
Charles Audet, Frédéric Messine, Jordan Ninin
J. Glob. Optim.1
2022 Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems
Charles Audet, Frédéric Messine, Jordan Ninin
J. Glob. Optim.1
2022 Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
abstract
NOMAD is a state-of-the-art software package for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of NOMAD , version 3, dates to 2008. Minor releases are produced as new features are incorporated. The present work describes NOMAD 4, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities, and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the MegaSearchPoll component, warm and hot restarts, and a revised version of the PsdMads algorithm. Another main improvement of NOMAD 4 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization are simpler than before, while overall optimization performance is maintained between versions 3 and 4. NOMAD is freely available at www.gerad.ca/nomad and the whole project is visible at github.com/bbopt/nomad.
Charles Audet, Sébastien Le Digabel, Viviane Rochon Montplaisir, Christophe Tribes
ACM Trans. Math. Softw.1
2021 Using symbolic calculations to determine largest small polygons
Charles Audet, Pierre Hansen, Dragutin Svrtan
J. Glob. Optim.1
2018 Order-based error for managing ensembles of surrogates in mesh adaptive direct search
Charles Audet, Michael Kokkolaras, Sébastien Le Digabel, Bastien Talgorn
J. Glob. Optim.1
2014 PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD
abstract
BACKGROUND: PSEUDOMARKER is a software package that performs joint linkage and linkage disequilibrium analysis between a marker and a putative disease locus. A key feature of PSEUDOMARKER is that it can combine case-controls and pedigrees of varying structure into a single unified analysis. Thus it maximizes the full likelihood of the data over marker allele frequencies or conditional allele frequencies on disease and recombination fraction. RESULTS: The new version 2.0 uses the software package NOMAD to maximize likelihoods, resulting in generally comparable or better optima with many fewer evaluations of the likelihood functions. CONCLUSIONS: After being modified substantially to use modern optimization methods, PSEUDOMARKER version 2.0 is more robust and substantially faster than version 1.0. NOMAD may be useful in other bioinformatics problems where complex likelihood functions are optimized.
E. Michael Gertz, Tero Hiekkalinna, Sébastien Le Digabel, Charles Audet, Joseph D. Terwilliger, Alejandro A. Schäffer
BMC Bioinform.4
2013 The Small Octagons of Maximal Width
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin
Discret. Comput. Geom.1
2013 Maximal perimeter, diameter and area of equilateral unit-width convex polygons
Charles Audet, Jordan Ninin
J. Glob. Optim.1
2012 Construction of sparse signal representations with adaptive multiscale orthogonal bases
Antoine Saucier, Charles Audet
Signal Process.2
2011 The small hexagon and heptagon with maximum sum of distances between vertices
Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron
J. Glob. Optim.1
2011 Remarks on solutions to a nonconvex quadratic programming test problem
Charles Audet, Pierre Hansen, Sylvain Perron
J. Glob. Optim.1
2009 Isoperimetric Polygons of Maximum Width
Charles Audet, Pierre Hansen, Frédéric Messine
Discret. Comput. Geom.1
2009 Simple Polygons of Maximum Perimeter Contained in a Unit Disk
Charles Audet, Pierre Hansen, Frédéric Messine
Discret. Comput. Geom.1
2008 Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
Charles Audet, Vincent Béchard, Sébastien Le Digabel
J. Glob. Optim.1
2007 Extremal problems for convex polygons
Charles Audet, Pierre Hansen, Frédéric Messine
J. Glob. Optim.1
2004 An Exact Method for Fractional Goal Programming
Charles Audet, Emilio Carrizosa, Pierre Hansen
J. Glob. Optim.1