A conjugate direction algorithm without line searches

DOI10.1007/BF00933447zbMath0348.65061MaRDI QIDQ1234560

Larry Nazareth

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (45)

Computational linear algebra issues in the Galerkin boundary element method ⋮ Conjugate gradient algorithms in nonlinear structural analysis problems ⋮ A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations ⋮ Minimization of extended quadratic functions with inexact line searches ⋮ Estimation of two-phase petroleum reservoir properties by regularization ⋮ An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A new taxonomy of conjugate gradient methods ⋮ Global convergence of a memory gradient method for unconstrained optimization ⋮ New imperfect conjugate gradient algorithm ⋮ New three-term conjugate gradient method with guaranteed global convergence ⋮ A generalized conjugate gradient algorithm for minimization ⋮ A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ Efficient implementation of a generalized polak-ribière algorithm for nonlinear optimization ⋮ An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints ⋮ An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization ⋮ Conjugate gradient methods using quasi-Newton updates with inexact line searches ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A breakdown of the block CG method ⋮ Unnamed Item ⋮ Conjugate gradient methods using value of objective function for unconstrained optimization ⋮ Unnamed Item ⋮ Conjugate gradient algorithms and the Galerkin boundary element method ⋮ Some descent three-term conjugate gradient methods and their global convergence ⋮ An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems ⋮ Accelerated conjugate direction methods for unconstrained optimization ⋮ A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ Some three-term conjugate gradient methods with the inexact line search condition ⋮ On three-term conjugate gradient algorithms for unconstrained optimization ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ Unified approach to unconstrained minimization via basic matrix factorizations ⋮ Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method ⋮ A spectral three-term Hestenes-Stiefel conjugate gradient method ⋮ Unnamed Item ⋮ Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations ⋮ A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications ⋮ Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization ⋮ Some three-term conjugate gradient methods with the new direction structure ⋮ A new three-term conjugate gradient method ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ Vectorization of conjugate-gradient methods for large-scale minimization in meteorology ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ⋮ A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization ⋮ Use of a nonquadratic model in a conjugate-gradient method of optimization with inexact line searches, unconstrained minimization ⋮ Conjugate direction methods with variable storage

Cites Work

• Unnamed Item
• Unnamed Item
• Unified approach to unconstrained minimization via basic matrix factorizations
• An Iterative Method for Finding Stationary Values of a Function of Several Variables
• Optimally conditioned optimization algorithms without line searches
• A Rapidly Convergent Descent Method for Minimization
• Function minimization by conjugate gradients
• The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
• Recent advances in unconstrained optimization
• Methods of conjugate gradients for solving linear systems

This page was built for publication: A conjugate direction algorithm without line searches