Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
type: Item
instance of: scholarly article
title: Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
zbMATH Open document ID: 1387.65052
author: Qunfeng Liu
published in: Numerical Algorithms
publication date: 2011-12-14T00:00:00Z
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5988288
zbMATH Keywords: direct search
zbMATH Keywords: frame-based direct search
zbMATH Keywords: minimal positive basis
zbMATH Keywords: descent conjugate gradient
zbMATH Keywords: data profiles
zbMATH Keywords: performance profiles
zbMATH Keywords: convergence
zbMATH Keywords: algorithms
describes a project that uses: COBYLA2
describes a project that uses: minpack
describes a project that uses: NEWUOA
describes a project that uses: DFO
MaRDI profile type: Publication
full work available at URL: s11075-011-9464-7
OpenAlex ID: W2085532948
cites work: Analysis of Generalized Pattern Searches
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Q4421356
cites work: Frame based methods for unconstrained optimization
cites work: On the convergence of grid-based methods for unconstrained optimization
cites work: Positive bases in numerical optimization
cites work: Q3155232
cites work: Using Sampling and Simplex Derivatives in Pattern Search Methods
cites work: Using simplex gradients of nonsmooth functions in direct search methods
cites work: Incorporating minimum Frobenius norm models in direct search
cites work: Variable Metric Method for Minimization
cites work: Theory of Positive Linear Dependence
cites work: On the Local Convergence of Pattern Search
cites work: Benchmarking optimization software with performance profiles.
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Survey of trust-region derivative free optimization methods
cites work: Q4435425
cites work: Stationarity Results for Generating Set Search for Linearly Constrained Optimization
cites work: Pattern Search Algorithms for Bound Constrained Minimization
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: Implementing Generating Set Search Methods for Linearly Constrained Minimization
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Q4215359
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: On the Convergence of Pattern Search Algorithms
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
DOI: 10.1007/S11075-011-9464-7
description: scientific article; zbMATH DE number 5988288