Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases
type: Item
instance of: scholarly article
title: Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases
zbMATH Open document ID: 1487.65025
author: Rachael Tappenden
author: Ian D. Coope
published in: Numerical Algorithms
publication date: 2021-09-27T00:00:00Z
Mathematics Subject Classification ID: 65D25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7401541
zbMATH Keywords: derivative free optimization
zbMATH Keywords: positive bases
zbMATH Keywords: finite difference approximations
zbMATH Keywords: interpolation models
zbMATH Keywords: simplices
zbMATH Keywords: simplex gradients
describes a project that uses: DiffSharp
describes a project that uses: MOIF
describes a project that uses: DFO
MaRDI profile type: Publication
full work available at URL: s11075-020-01056-8
OpenAlex ID: W3139102753
Wikidata QID: Q114224303
cites work: Derivative-Free and Blackbox Optimization
cites work: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
cites work: Q4558473
cites work: An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
cites work: Introduction to Derivative-Free Optimization
cites work: Recent progress in unconstrained nonlinear optimization without derivatives
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
cites work: Q4524222
cites work: Frame based methods for unconstrained optimization
cites work: Efficient calculation of regular simplex gradients
cites work: On the geometry phase in model-based algorithms for derivative-free optimization
cites work: An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
cites work: Q4838405
cites work: Adaptive Interpolation Strategies in Derivative-Free Optimization: a case study
cites work: Calculus Identities for Generalized Simplex Gradients: Rules and Applications
cites work: A Hitchhiker's guide to automatic differentiation
cites work: Uniform simplex of an arbitrary orientation
cites work: A Derivative-Free Trust-Region Algorithm for the Optimization of Functions Smoothed via Gaussian Convolution Using Adaptive Multiple Importance Sampling
cites work: A Simplex Method for Function Minimization
cites work: Random gradient-free minimization of convex functions
cites work: Q5491447
cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
cites work: Global convergence of radial basis function trust-region algorithms for derivative-free optimization
DOI: 10.1007/S11075-020-01056-8
description: scientific article; zbMATH DE number 7401541