A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
DOI10.1016/0016-0032(80)90081-2zbMath0431.90065OpenAlexW2093701797MaRDI QIDQ1138482
M. A. Townsend, Glenn Eric Johnson
Publication date: 1980
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(80)90081-2
direct search methodgolden section searchnumerical experiencegeneralized conjugate gradient algorithmalgorithmic comparisonsconstrained industrial problemmultivariate minimization methodstandard unconstrained test functionstest runs
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Specification and verification (program logics, model checking, etc.) (68Q60) Methods of reduced gradient type (90C52)
Related Items (1)
Cites Work
- On the solution of the unidimensional local minimization problem
- A conjugate direction algorithm without line searches
- Nonoptimal termination properties of quadratic interpolation univariate searches
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
- An effective algorithm for minimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Comparison of some conjugate direction procedures for function minimization
- Quadratically convergent algorithms and one-dimensional search schemes
- `` Direct Search Solution of Numerical and Statistical Problems
- Optimally conditioned optimization algorithms without line searches
- Quasi-Newton Methods, Motivation and Theory
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Convergence Conditions for Ascent Methods
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
- Practical convergence conditions for unconstrained optimization
- Methods of conjugate gradients for solving linear systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
