Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
type: Item
instance of: scholarly article
title: Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions
zbMATH Open document ID: 1284.90081
author: Benjamin Van Dyke
author: Thomas J. Asaki
published in: Journal of Optimization Theory and Applications
publication date: 2014-04-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6276387
zbMATH Keywords: mesh adaptive direct search (Mads) algorithms
zbMATH Keywords: derivative-free optimization
describes a project that uses: OrthoMADS
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10957-013-0356-y
OpenAlex ID: W2149667670
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Convergence of Mesh Adaptive Direct Search to Second‐Order Stationary Points
cites work: Optimization and nonsmooth analysis
cites work: Analysis of direct searches for discontinuous functions
cites work: Generalized Directional Derivatives and Subgradients of Nonconvex Functions
cites work: On the Convergence of Pattern Search Algorithms
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Frame based methods for unconstrained optimization
cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
cites work: A partition of the unit sphere into regions of equal area and small diameter
cites work: Diameter bounds for equal area partitions of the unit sphere
cites work: Erratum: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Testing Unconstrained Optimization Software
cites work: The concentration of measure phenomenon
DOI: 10.1007/S10957-013-0356-Y
description: scientific article