Charles Audet
About
In The Last Decade
Charles Audet
129 papers receiving 4.7k citations
Hit Papers
Peers
Comparison fields: 5 of 166
- Computational Theory and Mathematics 1.9k
- Numerical Analysis 1.4k
- Artificial Intelligence 1.2k
- Control and Systems Engineering 1.0k
- Management Science and Operations Research 539
Countries citing papers authored by Charles Audet
This map shows the geographic impact of Charles Audet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Charles Audet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Charles Audet more than expected).
Fields of papers citing papers by Charles Audet
This network shows the impact of papers produced by Charles Audet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Charles Audet. The network helps show where Charles Audet may publish in the future.
Co-authorship network of co-authors of Charles Audet
This figure shows the co-authorship network connecting the top 25 collaborators of Charles Audet. A scholar is included among the top collaborators of Charles Audet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Charles Audet. Charles Audet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Order-based error for managing ensembles of surrogates in derivative-free optimization | 4 |
| 2 | A progressive barrier derivative-free trust-region algorithm for constrained optimization | 2 |
| 3 | A derivative-free trust-region augmented Lagrangian algorithm | 1 |
| 4 | Efficient solution of quadratically constrained quadratic subproblems within a direct-search algorithm | 2 |
| 5 | Dynamic scaling in the Mesh Adaptive Direct Search algorithm for blackbox optimization | 1 |
| 6 | Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms | 1 |
| 7 | Efficient Use of Parallelism in Algorithmic Parameter Optimization Applications | 1 |
| 8 | Maximal Perimeter, Diameter and Area of Equilateral Unit-Width Convex Polygons | 0 |
| 9 | Construction of Sparse Signal Representations with Adaptive Multiscale Orthogonal Bases | 1 |
| 10 | Calculating Optimal Conditions for Alloy and Process Design Using Thermodynamic and Properties Databases, the FactSage Software and the Mesh Adaptive Direct Search (MADS) Algorithm | 1 |
| 11 | OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions | 1 |
| 12 | A MADS Algorithm with a Progressive Barrier for Derivative-Free Nonlinear Programming | 7 |
| 13 | Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm | 2 |
| 14 | Quatre Petits Octogones | 2 |
| 15 | Mesh Adaptive Direct Search Algorithms for Constrained Optimization | 14 |
| 16 | Convergence Results for Pattern Search Algorithms are Tight | 33 |
| 17 | A Pattern Search Filter Method for Nonlinear Programming without Derivatives | 3 |
| 18 | Pooling Problem: Alternate Formulations and Solution Methods | 1 |
| 19 | Complete Enumeration of Equilibria for Two-Person Games in Strategic and Sequence Forms | 2 |
| 20 | Links Between the Linear Bilevel and Mixed 0-1 Programming Problems | 2 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.