OrthoMADS

Orthomads: A deterministic MADS instance with orthogonal directions The purpose of this paper is to introduce a new way of choosing directions for the mesh adaptive direct search (Mads) class of algorithms. The advantages of this new OrthoMads instantiation of Mads are that the polling directions are chosen deterministically, ensuring that the results of a given run are repeatable, and that they are orthogonal to each other, which yields convex cones of missed directions at each iteration that are minimal in a reasonable measure. Convergence results for OrthoMads follow directly from those already published for Mads, and they hold deterministically, rather than with probability one, as is the case for LtMads, the first Mads instance. The initial numerical results are quite good for both smooth and nonsmooth and constrained and unconstrained problems considered here.


References in zbMATH (referenced in 43 articles )

Showing results 1 to 20 of 43.
Sorted by year (citations)

1 2 3 next

  1. Audet, Charles; Côté-Massicotte, Julien: Dynamic improvements of static surrogates in direct search optimization (2019)
  2. Bei, Xiaoqiang; Zhu, Xiaoyan; Coit, David W.: A risk-averse stochastic program for integrated system design and preventive maintenance planning (2019)
  3. Bűrmen, Árpád; Fajfar, Iztok: Mesh adaptive direct search with simplicial Hessian update (2019)
  4. Larson, Jeffrey; Menickelly, Matt; Wild, Stefan M.: Derivative-free optimization methods (2019)
  5. Latorre, Vittorio; Habal, Husni; Graeb, Helmut; Lucidi, Stefano: Derivative free methodologies for circuit worst case analysis (2019)
  6. Audet, Charles; Ihaddadene, Amina; Le Digabel, Sébastien; Tribes, Christophe: Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm (2018)
  7. Audet, Charles; Kokkolaras, Michael; Le Digabel, Sébastien; Talgorn, Bastien: Order-based error for managing ensembles of surrogates in mesh adaptive direct search (2018)
  8. Dreisigmeyer, David W.: Direct search methods on reductive homogeneous spaces (2018)
  9. Liuzzi, G.; Truemper, K.: Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (2018)
  10. Beyhaghi, Pooriya; Bewley, Thomas: Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization (2017)
  11. Boukouvala, Fani; Faruque Hasan, M. M.; Floudas, Christodoulos A.: Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption (2017)
  12. Price, C. J.: A direct search quasi-Newton method for nonsmooth unconstrained optimization (2017)
  13. Armstrong, Jerawan C.; Favorite, Jeffrey A.: Using a derivative-free optimization method for multiple solutions of inverse transport problems (2016)
  14. Audet, Charles; Le Digabel, Sébastien; Tribes, Christophe: Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization (2016)
  15. Bahrami, Salman; Tribes, C.; Devals, C.; Vu, T. C.; Guibault, F.: Multi-fidelity shape optimization of hydraulic turbine runner blades using a multi-objective mesh adaptive direct search algorithm (2016)
  16. Beyhaghi, Pooriya; Bewley, Thomas R.: Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (2016)
  17. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  18. Gheribi, Aïmen E.; Harvey, Jean-Philippe; Bélisle, Eve; Robelin, Christian; Chartrand, Patrice; Pelton, Arthur D.; Bale, Christopher W.; Le Digabel, Sébastien: Use of a biobjective direct search algorithm in the process design of material science applications (2016)
  19. Regis, Rommel G.: On the properties of positive spanning sets and positive bases (2016)
  20. Audet, Charles; Le Digabel, Sébastien; Peyrega, Mathilde: Linear equalities in blackbox optimization (2015)

1 2 3 next