Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
From MaRDI portal
Publication:652326
DOI10.1007/s11075-011-9464-7zbMath1387.65052OpenAlexW2085532948MaRDI QIDQ652326
Publication date: 14 December 2011
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-011-9464-7
algorithmsconvergencedirect searchperformance profilesdata profilesdescent conjugate gradientframe-based direct searchminimal positive basis
Related Items
A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ Efficient calculation of regular simplex gradients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incorporating minimum Frobenius norm models in direct search
- Survey of trust-region derivative free optimization methods
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- On the Convergence of Pattern Search Algorithms
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Using simplex gradients of nonsmooth functions in direct search methods
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- Variable Metric Method for Minimization
- On the Convergence of the Multidirectional Search Algorithm
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Analysis of Generalized Pattern Searches
- On the Local Convergence of Pattern Search
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern Search Algorithms for Bound Constrained Minimization
- Benchmarking Derivative-Free Optimization Algorithms
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Theory of Positive Linear Dependence
- Frame based methods for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Positive bases in numerical optimization
