A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
type: Item
instance of: scholarly article
title: A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
zbMATH Open document ID: 0431.90065
DOI: 10.1016/0016-0032(80)90081-2
author: M. A. Townsend
author: Glenn Eric Johnson
published in: Journal of the Franklin Institute
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 3672026
zbMATH Keywords: direct search method
zbMATH Keywords: golden section search
zbMATH Keywords: multivariate minimization method
zbMATH Keywords: generalized conjugate gradient algorithm
zbMATH Keywords: standard unconstrained test functions
zbMATH Keywords: constrained industrial problem
zbMATH Keywords: numerical experience
zbMATH Keywords: test runs
zbMATH Keywords: algorithmic comparisons
MaRDI profile type: Publication
full work available at URL: 0016-0032(80)90081-2
OpenAlex ID: W2093701797
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: Function minimization by conjugate gradients
cites work: Q5563083
cites work: Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: An effective algorithm for minimization
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: A new approach to variable metric algorithms
cites work: Optimally conditioned optimization algorithms without line searches
cites work: In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
cites work: Convergence Conditions for Ascent Methods
cites work: Practical convergence conditions for unconstrained optimization
cites work: Q5684177
cites work: Q5672476
cites work: Q5585896
cites work: Methods of conjugate gradients for solving linear systems
cites work: Comparison of some conjugate direction procedures for function minimization
cites work: Q4091368
cites work: Q5684173
cites work: Q4765946
cites work: Quadratically convergent algorithms and one-dimensional search schemes
cites work: A conjugate direction algorithm without line searches
cites work: An efficient method for finding the minimum of a function of several variables without calculating derivatives
cites work: Q3671858
cites work: Q5672465
cites work: Q4060751
cites work: On the solution of the unidimensional local minimization problem
cites work: A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
cites work: Q5588268
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Q5663326
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: Nonoptimal termination properties of quadratic interpolation univariate searches
description: scientific article; zbMATH DE number 3672026