Charles Audet

Pierre-Yves Bouchet

Loïc Bourdin

Optim. Lett., January, 2025

2024

Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions".

[BibT_eX]

[DOI]

Pierre-Yves Bouchet

Loïc Bourdin

Math. Program., November, 2024

A graph-structured distance for heterogeneous datasets with meta variables.

[BibT_eX]

[DOI]

CoRR, 2024

2022

Escaping Unknown Discontinuous Regions in Blackbox Optimization.

[BibT_eX]

[DOI]

Alain Batailly

Solène Kojtych

SIAM J. Optim., September, 2022

Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm.

[BibT_eX]

[DOI]

Viviane Rochon Montplaisir

ACM Trans. Math. Softw., 2022

Hierarchically constrained blackbox optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2022

The equilateral small octagon of maximal width.

[BibT_eX]

[DOI]

Christian Bingane

Math. Comput., 2022

Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems.

[BibT_eX]

[DOI]

Jordan Ninin

J. Glob. Optim., 2022

Numerical certification of Pareto optimality for biobjective nonlinear problems.

[BibT_eX]

[DOI]

Jordan Ninin

J. Glob. Optim., 2022

Quantifying uncertainty with ensembles of surrogates for blackbox optimization.

[BibT_eX]

[DOI]

Renaud Saltet

Comput. Optim. Appl., 2022

Constrained blackbox optimization with the NOMAD solver on the COCO constrained test suite.

[BibT_eX]

[DOI]

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Second order sliding mode twisting controller tuning based on two-level optimization process.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021

Optimization of Stochastic Blackboxes with Adaptive Precision.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Combining Cross-Entropy and MADS Methods for Inequality Constrained Global Optimization.

[BibT_eX]

[DOI]

Jean Bigeon

Romain Couderc

Oper. Res. Forum, 2021

Using symbolic calculations to determine largest small polygons.

[BibT_eX]

[DOI]

Dragutin Svrtan

J. Glob. Optim., 2021

Performance indicators in multiobjective optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

Two decades of blackbox optimization applications.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2021

NOMAD version 4: Nonlinear optimization with the MADS algorithm.

[BibT_eX]

[DOI]

Viviane Rochon Montplaisir

CoRR, 2021

Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates.

[BibT_eX]

[DOI]

Kwassi Joseph Dzahini

Michael Kokkolaras

Comput. Optim. Appl., 2021

2020

Binary, unrelaxable and hidden constraints in blackbox optimization.

[BibT_eX]

[DOI]

Gilles Caporossi

Stéphane Jacquet

Oper. Res. Lett., 2020

Monotonic grey box direct search optimization.

[BibT_eX]

[DOI]

Optim. Lett., 2020

2019

The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables.

[BibT_eX]

[DOI]

SIAM J. Optim., 2019

Dynamic improvements of static surrogates in direct search optimization.

[BibT_eX]

[DOI]

Julien Côté-Massicotte

Optim. Lett., 2019

2018

Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm.

[BibT_eX]

[DOI]

Optim. Lett., 2018

Order-based error for managing ensembles of surrogates in mesh adaptive direct search.

[BibT_eX]

[DOI]

J. Glob. Optim., 2018

Tuning Runge-Kutta parameters on a family of ordinary differential equations.

[BibT_eX]

[DOI]

Int. J. Math. Model. Numer. Optimisation, 2018

Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Mesh-based Nelder-Mead algorithm for inequality constrained optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

A progressive barrier derivative-free trust-region algorithm for constrained optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

2017

Maximal Area of Equilateral Small Polygons.

[BibT_eX]

[DOI]

Am. Math. Mon., 2017

Stochastic short-term hydropower planning with inflow scenario trees.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

2015

Linear equalities in blackbox optimization.

[BibT_eX]

[DOI]

Mathilde Peyrega

Comput. Optim. Appl., 2015

2014

Reducing the Number of Function Evaluations in Mesh Adaptive Direct Search Algorithms.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

A variance-based method to rank input variables of the Mesh Adaptive Direct Search algorithm.

[BibT_eX]

[DOI]

Luc Adjengue

Imen Ben Yahia

Optim. Lett., 2014

Optimization of algorithms with OPAL.

[BibT_eX]

[DOI]

Kien-Cong Dang

Math. Program. Comput., 2014

PSEUDOMARKER 2.0: efficient computation of likelihoods using NOMAD.

[BibT_eX]

[DOI]

Joseph D. Terwilliger

Alejandro A. Schäffer

BMC Bioinform., 2014

2013

Efficient use of parallelism in algorithmic parameter optimization applications.

[BibT_eX]

[DOI]

Cong-Kien Dang

Optim. Lett., 2013

Maximal perimeter, diameter and area of equilateral unit-width convex polygons.

[BibT_eX]

[DOI]

Jordan Ninin

J. Glob. Optim., 2013

The Small Octagons of Maximal Width.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

2012

Construction of sparse signal representations with adaptive multiscale orthogonal bases.

[BibT_eX]

[DOI]

Antoine Saucier

Signal Process., 2012

Trade-off studies in blackbox optimization.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2012

On proper refinement of Nash equilibria for bimatrix games.

[BibT_eX]

[DOI]

Slim Belhaiza

Autom., 2012

2011

A short proof on the cardinality of maximal positive bases.

[BibT_eX]

[DOI]

Optim. Lett., 2011

Remarks on solutions to a nonconvex quadratic programming test problem.

[BibT_eX]

[DOI]

Sylvain Perron

J. Glob. Optim., 2011

The small hexagon and heptagon with maximum sum of distances between vertices.

[BibT_eX]

[DOI]

J. Glob. Optim., 2011

2010

A note on diameters of point sets.

[BibT_eX]

[DOI]

Optim. Lett., 2010

A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation.

[BibT_eX]

[DOI]

Sethuraman Sankaran

Alison L. Marsden

J. Comput. Phys., 2010

A mesh adaptive direct search algorithm for multiobjective optimization.

[BibT_eX]

[DOI]

Walid Zghal

Eur. J. Oper. Res., 2010

Globalization strategies for Mesh Adaptive Direct Search.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2010

Algorithmic Parameter Optimization of the DFO Method with the OPAL Framework.

[BibT_eX]

[DOI]

Cong-Kien Dang

Proceedings of the Software Automatic Tuning, From Concepts to State-of-the-Art Results, 2010

2009

A Progressive Barrier for Derivative-Free Nonlinear Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

Mesh adaptive direct search algorithms for mixed variable optimization.

[BibT_eX]

[DOI]

Optim. Lett., 2009

A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games.

[BibT_eX]

[DOI]

Slim Belhaiza

IGTR, 2009

Simple Polygons of Maximum Perimeter Contained in a Unit Disk.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Isoperimetric Polygons of Maximum Width.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

2008

Multiobjective Optimization Through a Series of Single-Objective Formulations.

[BibT_eX]

[DOI]

Walid Zghal

SIAM J. Optim., 2008

Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm.

[BibT_eX]

[DOI]

SIAM J. Optim., 2008

Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization.

[BibT_eX]

[DOI]

Ana Luísa Custódio

SIAM J. Optim., 2008

Exact <i>L</i> <sub>2</sub>-norm plane separation.

[BibT_eX]

[DOI]

Optim. Lett., 2008

Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search.

[BibT_eX]

[DOI]

Vincent Béchard

J. Glob. Optim., 2008

2007

Disjunctive cuts for continuous linear bilevel programming.

[BibT_eX]

[DOI]

Jean Haddad

Optim. Lett., 2007

Extremal problems for convex polygons.

[BibT_eX]

[DOI]

J. Glob. Optim., 2007

The small octagon with longest perimeter.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

2006

Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

Mesh Adaptive Direct Search Algorithms for Constrained Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

Convergence of Mesh Adaptive Direct Search to Second-Order Stationary Points.

[BibT_eX]

[DOI]

Mark A. Abramson

SIAM J. Optim., 2006

A note on the definition of a linear bilevel programming solution.

[BibT_eX]

[DOI]

Jean Haddad

Appl. Math. Comput., 2006

2004

A Pattern Search Filter Method for Nonlinear Programming without Derivatives.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

Generalized pattern searches with derivative information.

[BibT_eX]

[DOI]

Mark A. Abramson

Math. Program., 2004

Pooling Problem: Alternate Formulations and Solution Methods.

[BibT_eX]

[DOI]

Manag. Sci., 2004

An Exact Method for Fractional Goal Programming.

[BibT_eX]

[DOI]

Emilio Carrizosa

J. Glob. Optim., 2004

The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2004

2002

Analysis of Generalized Pattern Searches.

[BibT_eX]

[DOI]

SIAM J. Optim., 2002

The Largest Small Octagon.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

2001

Enumeration of All Extreme Equilibria of Bimatrix Games.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2001

Pattern Search Algorithms for Mixed Variable Programming.

[BibT_eX]

[DOI]