default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles Audet
Person information
- affiliation: Polytechnique Montréal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Charles Audet
, Pierre-Yves Bouchet, Loïc Bourdin:
Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions". Math. Program. 208(1): 411-424 (2024)- [i2]Edward Hallé-Hannan, Charles Audet, Youssef Diouane, Sébastien Le Digabel, Paul Saves:
A graph-structured distance for heterogeneous datasets with meta variables. CoRR abs/2405.13073 (2024) - 2022
- [j73]Charles Audet, Sébastien Le Digabel, Renaud Saltet:
Quantifying uncertainty with ensembles of surrogates for blackbox optimization. Comput. Optim. Appl. 83(1): 29-66 (2022) - [j72]Charles Audet, Frédéric Messine, Jordan Ninin:
Numerical certification of Pareto optimality for biobjective nonlinear problems. J. Glob. Optim. 83(4): 891-908 (2022) - [j71]Charles Audet, Frédéric Messine, Jordan Ninin:
Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems. J. Glob. Optim. 83(4): 909-910 (2022) - [j70]Christian Bingane, Charles Audet:
The equilateral small octagon of maximal width. Math. Comput. 91(336): 2027-2040 (2022) - [j69]Stéphane Alarie, Charles Audet, Paulin Jacquot, Sébastien Le Digabel:
Hierarchically constrained blackbox optimization. Oper. Res. Lett. 50(5): 446-451 (2022) - [j68]Charles Audet, Alain Batailly, Solène Kojtych:
Escaping Unknown Discontinuous Regions in Blackbox Optimization. SIAM J. Optim. 32(3): 1843-1870 (2022) - [j67]Charles Audet, Sébastien Le Digabel, Viviane Rochon Montplaisir, Christophe Tribes:
Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm. ACM Trans. Math. Softw. 48(3): 35:1-35:22 (2022) - [c2]Dominique Monnet, Alexandre Goldsztejn, Franck Plestan, Charles Audet:
Second order sliding mode twisting controller tuning based on two-level optimization process. CDC 2022: 6830-6835 - [c1]Charles Audet, Sébastien Le Digabel, Ludovic Salomon, Christophe Tribes:
Constrained blackbox optimization with the NOMAD solver on the COCO constrained test suite. GECCO Companion 2022: 1683-1690 - 2021
- [j66]Charles Audet, Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel:
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates. Comput. Optim. Appl. 79(1): 1-34 (2021) - [j65]Stéphane Alarie, Charles Audet, Aïmen E. Gheribi, Michael Kokkolaras, Sébastien Le Digabel:
Two decades of blackbox optimization applications. EURO J. Comput. Optim. 9: 100011 (2021) - [j64]Charles Audet, Jean Bigeon, Dominique Cartier, Sébastien Le Digabel, Ludovic Salomon:
Performance indicators in multiobjective optimization. Eur. J. Oper. Res. 292(2): 397-422 (2021) - [j63]Charles Audet, Pierre Hansen, Dragutin Svrtan:
Using symbolic calculations to determine largest small polygons. J. Glob. Optim. 81(1): 261-268 (2021) - [j62]Charles Audet, Jean Bigeon, Romain Couderc:
Combining Cross-Entropy and MADS Methods for Inequality Constrained Global Optimization. Oper. Res. Forum 2(3) (2021) - [j61]Stéphane Alarie, Charles Audet, Pierre-Yves Bouchet, Sébastien Le Digabel:
Optimization of Stochastic Blackboxes with Adaptive Precision. SIAM J. Optim. 31(4): 3127-3156 (2021) - [i1]Charles Audet, Sébastien Le Digabel, Viviane Rochon Montplaisir, Christophe Tribes:
NOMAD version 4: Nonlinear optimization with the MADS algorithm. CoRR abs/2104.11627 (2021) - 2020
- [j60]Charles Audet, Pascal Côté, Catherine Poissant, Christophe Tribes:
Monotonic grey box direct search optimization. Optim. Lett. 14(1): 3-18 (2020) - [j59]Charles Audet, Gilles Caporossi, Stéphane Jacquet:
Binary, unrelaxable and hidden constraints in blackbox optimization. Oper. Res. Lett. 48(4): 467-471 (2020)
2010 – 2019
- 2019
- [j58]Charles Audet, Julien Côté-Massicotte:
Dynamic improvements of static surrogates in direct search optimization. Optim. Lett. 13(6): 1433-1447 (2019) - [j57]Charles Audet, Sébastien Le Digabel, Christophe Tribes:
The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables. SIAM J. Optim. 29(2): 1164-1189 (2019) - 2018
- [j56]Charles Audet, Andrew R. Conn, Sébastien Le Digabel, Mathilde Peyrega:
A progressive barrier derivative-free trust-region algorithm for constrained optimization. Comput. Optim. Appl. 71(2): 307-329 (2018) - [j55]Charles Audet, Christophe Tribes:
Mesh-based Nelder-Mead algorithm for inequality constrained optimization. Comput. Optim. Appl. 71(2): 331-352 (2018) - [j54]Nadir Amaioua, Charles Audet, Andrew R. Conn, Sébastien Le Digabel:
Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm. Eur. J. Oper. Res. 268(1): 13-24 (2018) - [j53]Charles Audet:
Tuning Runge-Kutta parameters on a family of ordinary differential equations. Int. J. Math. Model. Numer. Optimisation 8(3): 277-286 (2018) - [j52]Charles Audet, Michael Kokkolaras, Sébastien Le Digabel, Bastien Talgorn:
Order-based error for managing ensembles of surrogates in mesh adaptive direct search. J. Glob. Optim. 70(3): 645-675 (2018) - [j51]Charles Audet, Amina Ihaddadene, Sébastien Le Digabel, Christophe Tribes:
Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm. Optim. Lett. 12(4): 675-689 (2018) - 2017
- [j50]Sara Séguin, Stein-Erik Fleten, Pascal Côté, Alois Pichler, Charles Audet:
Stochastic short-term hydropower planning with inflow scenario trees. Eur. J. Oper. Res. 259(3): 1156-1168 (2017) - [j49]Charles Audet:
Maximal Area of Equilateral Small Polygons. Am. Math. Mon. 124(2): 175-178 (2017) - 2015
- [j48]Charles Audet, Sébastien Le Digabel, Mathilde Peyrega:
Linear equalities in blackbox optimization. Comput. Optim. Appl. 61(1): 1-23 (2015) - 2014
- [j47]Edward Michael Gertz, Tero Hiekkalinna, Sébastien Le Digabel, Charles Audet, Joseph D. Terwilliger, Alejandro A. Schäffer:
PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD. BMC Bioinform. 15: 47 (2014) - [j46]Charles Audet, Kien-Cong Dang, Dominique Orban:
Optimization of algorithms with OPAL. Math. Program. Comput. 6(3): 233-254 (2014) - [j45]Luc Adjengue, Charles Audet, Imen Ben Yahia:
A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm. Optim. Lett. 8(5): 1599-1610 (2014) - [j44]Charles Audet, Andrea Ianni, Sébastien Le Digabel, Christophe Tribes:
Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms. SIAM J. Optim. 24(2): 621-642 (2014) - 2013
- [j43]Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin:
The Small Octagons of Maximal Width. Discret. Comput. Geom. 49(3): 589-600 (2013) - [j42]Charles Audet, Jordan Ninin:
Maximal perimeter, diameter and area of equilateral unit-width convex polygons. J. Glob. Optim. 56(3): 1007-1016 (2013) - [j41]Charles Audet, Cong-Kien Dang, Dominique Orban:
Efficient use of parallelism in algorithmic parameter optimization applications. Optim. Lett. 7(3): 421-433 (2013) - 2012
- [j40]Slim Belhaiza, Charles Audet, Pierre Hansen:
On proper refinement of Nash equilibria for bimatrix games. Autom. 48(2): 297-303 (2012) - [j39]Charles Audet, John E. Dennis Jr., Sébastien Le Digabel:
Trade-off studies in blackbox optimization. Optim. Methods Softw. 27(4-5): 613-624 (2012) - [j38]Antoine Saucier, Charles Audet:
Construction of sparse signal representations with adaptive multiscale orthogonal bases. Signal Process. 92(6): 1446-1457 (2012) - 2011
- [j37]Charles Audet, Anthony Guillou, Pierre Hansen, Frédéric Messine, Sylvain Perron:
The small hexagon and heptagon with maximum sum of distances between vertices. J. Glob. Optim. 49(3): 467-480 (2011) - [j36]Charles Audet, Pierre Hansen, Sylvain Perron:
Remarks on solutions to a nonconvex quadratic programming test problem. J. Glob. Optim. 50(2): 363-369 (2011) - [j35]Charles Audet:
A short proof on the cardinality of maximal positive bases. Optim. Lett. 5(1): 191-194 (2011) - 2010
- [j34]Charles Audet, John E. Dennis Jr., Sébastien Le Digabel:
Globalization strategies for Mesh Adaptive Direct Search. Comput. Optim. Appl. 46(2): 193-215 (2010) - [j33]Charles Audet, Gilles Savard, Walid Zghal:
A mesh adaptive direct search algorithm for multiobjective optimization. Eur. J. Oper. Res. 204(3): 545-556 (2010) - [j32]Sethuraman Sankaran, Charles Audet, Alison L. Marsden:
A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation. J. Comput. Phys. 229(12): 4664-4682 (2010) - [j31]Charles Audet, Xavier Fournier, Pierre Hansen, Frédéric Messine:
A note on diameters of point sets. Optim. Lett. 4(4): 585-595 (2010) - [p1]Charles Audet, Cong-Kien Dang, Dominique Orban:
Algorithmic Parameter Optimization of the DFO Method with the OPAL Framework. Software Automatic Tuning, From Concepts to State-of-the-Art Results 2010: 255-274
2000 – 2009
- 2009
- [j30]Charles Audet, Pierre Hansen, Frédéric Messine:
Isoperimetric Polygons of Maximum Width. Discret. Comput. Geom. 41(1): 45-60 (2009) - [j29]Charles Audet, Pierre Hansen, Frédéric Messine:
Simple Polygons of Maximum Perimeter Contained in a Unit Disk. Discret. Comput. Geom. 41(2): 208-215 (2009) - [j28]Charles Audet, Slim Belhaiza, Pierre Hansen:
A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games. IGTR 11(4): 437-451 (2009) - [j27]Mark A. Abramson, Charles Audet, James W. Chrissis, Jennifer G. Walston:
Mesh adaptive direct search algorithms for mixed variable optimization. Optim. Lett. 3(1): 35-47 (2009) - [j26]Charles Audet, John E. Dennis Jr.:
A Progressive Barrier for Derivative-Free Nonlinear Programming. SIAM J. Optim. 20(1): 445-472 (2009) - [j25]Mark A. Abramson, Charles Audet, John E. Dennis Jr., Sébastien Le Digabel:
OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions. SIAM J. Optim. 20(2): 948-966 (2009) - 2008
- [j24]Charles Audet, Vincent Béchard, Sébastien Le Digabel:
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search. J. Glob. Optim. 41(2): 299-318 (2008) - [j23]Charles Audet, Pierre Hansen, Alejandro Karam, Chi To Ng, Sylvain Perron:
Exact L 2-norm plane separation. Optim. Lett. 2(4): 483-495 (2008) - [j22]Charles Audet, Ana Luísa Custódio, John E. Dennis Jr.:
Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization. SIAM J. Optim. 18(4): 1501-1503 (2008) - [j21]Charles Audet, Gilles Savard, Walid Zghal:
Multiobjective Optimization Through a Series of Single-Objective Formulations. SIAM J. Optim. 19(1): 188-210 (2008) - [j20]Charles Audet, John E. Dennis Jr., Sébastien Le Digabel:
Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm. SIAM J. Optim. 19(3): 1150-1170 (2008) - 2007
- [j19]Charles Audet, Pierre Hansen, Frédéric Messine:
The small octagon with longest perimeter. J. Comb. Theory A 114(1): 135-150 (2007) - [j18]Charles Audet, Pierre Hansen, Frédéric Messine:
Extremal problems for convex polygons. J. Glob. Optim. 38(2): 163-179 (2007) - [j17]Charles Audet, Jean Haddad, Gilles Savard:
Disjunctive cuts for continuous linear bilevel programming. Optim. Lett. 1(3): 259-267 (2007) - 2006
- [j16]Charles Audet, Jean Haddad, Gilles Savard:
A note on the definition of a linear bilevel programming solution. Appl. Math. Comput. 181(1): 351-355 (2006) - [j15]Charles Audet, John E. Dennis Jr.:
Mesh Adaptive Direct Search Algorithms for Constrained Optimization. SIAM J. Optim. 17(1): 188-217 (2006) - [j14]Mark A. Abramson, Charles Audet:
Convergence of Mesh Adaptive Direct Search to Second-Order Stationary Points. SIAM J. Optim. 17(2): 606-619 (2006) - [j13]Charles Audet, Dominique Orban:
Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization. SIAM J. Optim. 17(3): 642-664 (2006) - 2004
- [j12]Charles Audet, Pierre Hansen, Frédéric Messine, Sylvain Perron:
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal. J. Comb. Theory A 108(1): 63-75 (2004) - [j11]Charles Audet, Emilio Carrizosa, Pierre Hansen:
An Exact Method for Fractional Goal Programming. J. Glob. Optim. 29(1): 113-120 (2004) - [j10]Charles Audet, Jack Brimberg, Pierre Hansen, Sébastien Le Digabel, Nenad Mladenovic:
Pooling Problem: Alternate Formulations and Solution Methods. Manag. Sci. 50(6): 761-776 (2004) - [j9]Mark A. Abramson, Charles Audet, John E. Dennis Jr.:
Generalized pattern searches with derivative information. Math. Program. 100(1): 3-25 (2004) - [j8]Charles Audet, John E. Dennis Jr.:
A Pattern Search Filter Method for Nonlinear Programming without Derivatives. SIAM J. Optim. 14(4): 980-1010 (2004) - 2002
- [j7]Charles Audet, Pierre Hansen, Frédéric Messine, Junjie Xiong:
The Largest Small Octagon. J. Comb. Theory A 98(1): 46-59 (2002) - [j6]Charles Audet, John E. Dennis Jr.:
Analysis of Generalized Pattern Searches. SIAM J. Optim. 13(3): 889-903 (2002) - 2001
- [j5]Stéphane Alarie, Charles Audet, Brigitte Jaumard, Gilles Savard:
Concavity cuts for disjoint bilinear programming. Math. Program. 90(2): 373-398 (2001) - [j4]Charles Audet, John E. Dennis Jr.:
Pattern Search Algorithms for Mixed Variable Programming. SIAM J. Optim. 11(3): 573-594 (2001) - [j3]Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard:
Enumeration of All Extreme Equilibria of Bimatrix Games. SIAM J. Sci. Comput. 23(1): 323-338 (2001) - 2000
- [j2]Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard:
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87(1): 131-152 (2000)
1990 – 1999
- 1999
- [j1]Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard:
A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85(3): 573-592 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
