Comparison of some conjugate direction procedures for function minimization

DOI10.1016/0016-0032(69)90253-1MaRDI QIDQ2549991zbMATH OpenOpenAlexFDO

Authors Harold W. Sorenson

Publication date 1969

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(69)90253-1

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A Rapidly Convergent Descent Method for Minimization
• A Review of Minimization Techniques for Nonlinear Functions
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Davidon’s Method in Hilbert Space
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 5345413 (Why is no real title available?)
• scientific article; zbMATH DE number 3301979 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• Nonlinear programming -- a survey
• Nonlinear Programming: A Numerical Survey
• Properties of the conjugate-gradient and Davidon methods
• Some Algorithms for Minimizing a Function of Several Variables

Cited in

(16)

• Conjugate gradient algorithms in nonlinear structural analysis problems
• A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
• Computational experience with conjugate gradient algorithms
• Approximation methods for the unconstrained optimization
• Nonoptimal termination properties of quadratic interpolation univariate searches
• In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
• Unconstrained approach to the extremization of constrained functions
• A Rank Two Algorithm for Unconstrained Minimization
• Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
• Simulating comparisons of different computing algorithms fitting zero-inflated Poisson models for zero abundant counts
• A constraint-space conjugate gradient method for function minimization and optimal control problems†
• Practical convergence conditions for unconstrained optimization
• On the Preconditioned Delayed Weighted Gradient Method
• Efficient generalized conjugate gradient algorithms. I: Theory
• Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems

This page was built for publication: Comparison of some conjugate direction procedures for function minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549991)