Conjugate Directions without Linear Searches

DOI10.1093/imamat/11.3.317zbMath0259.65060OpenAlexW2084643483MaRDI QIDQ5674899

L. C. W. Dixon

Publication date: 1973

Published in: IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imamat/11.3.317

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (28)

A continuous deformation algorithm for variational inequality problems on polytopes ⋮ A new class of supermemory gradient methods ⋮ A gradient-related algorithm with inexact line searches ⋮ Some computational advances in unconstrained optimization ⋮ Convergence of conjugate gradient methods with a closed-form stepsize formula ⋮ Convergence of supermemory gradient method ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ Memory gradient method with Goldstein line search ⋮ A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm ⋮ A method to accelerate the rate of convergence of a class of optimization algorithms ⋮ A new descent algorithm with curve search rule ⋮ Supermemory descent methods for unconstrained minimization ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ A new class of memory gradient methods with inexact line searches ⋮ Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems ⋮ Direct prediction methods in Hilbert space with applications to control problems ⋮ An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems ⋮ Accelerated conjugate direction methods for unconstrained optimization ⋮ Unified approach to unconstrained minimization via basic matrix factorizations ⋮ Some remarks on the symmetric rank-one update ⋮ Unnamed Item ⋮ Generating conjugate directions without line searches using factorized variable metric updating formulas ⋮ A restricted trust region algorithm for unconstrained optimization ⋮ A new three-term conjugate gradient method ⋮ Solution of nonlinear programming with unknown distribution function ⋮ A descent algorithm without line search for unconstrained optimization ⋮ Convergence of descent method without line search ⋮ A new super-memory gradient method with curve search rule

This page was built for publication: Conjugate Directions without Linear Searches