Generating poll directions for mesh adaptive direct search with realizations of a uniformly distributed random orthogonal matrix
zbMATH Open1353.90178MaRDI QIDQ2836067FDOQ2836067
Authors: Árpád Bűrmen, Tadej Tuma 
Publication date: 7 December 2016
Published in: Pacific Journal of Optimization (Search for Journal in Brave)
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol12/p809.html
Recommendations
- Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
- Mesh adaptive direct search algorithms for mixed variable optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- The mesh adaptive direct search algorithm for granular and discrete variables
- The mesh adaptive direct search algorithm for periodic variables
- Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
- Randomized weakly admissible meshes
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- A mesh adaptive direct search algorithm for multiobjective optimization
- An adaptive direct variational grid generation method
Numerical mathematical programming methods (65K05) Random matrices (algebraic aspects) (15B52) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (4)
This page was built for publication: Generating poll directions for mesh adaptive direct search with realizations of a uniformly distributed random orthogonal matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836067)
