Conjugate Directions without Linear Searches

DOI10.1093/IMAMAT/11.3.317MaRDI QIDQ5674899zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(28)

• A descent algorithm without line search for unconstrained optimization
• Some computational advances in unconstrained optimization
• Supermemory descent methods for unconstrained minimization
• Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems
• Direct prediction methods in Hilbert space with applications to control 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
• A continuous deformation algorithm for variational inequality problems on polytopes
• A new descent algorithm with curve search rule
• Solution of nonlinear programming with unknown distribution function
• Convergence of conjugate gradient methods with a closed-form stepsize formula
• Convergence of supermemory gradient method
• Memory gradient method with Goldstein line search
• On memory gradient method with trust region for unconstrained optimization
• Convergence of descent method without line search
• A new super-memory gradient method with curve search rule
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• scientific article; zbMATH DE number 3963115 (Why is no real title available?)
• A method to accelerate the rate of convergence of a class of optimization algorithms
• Generating conjugate directions without line searches using factorized variable metric updating formulas
• A new class of memory gradient methods with inexact line searches
• Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
• An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems
• A gradient-related algorithm with inexact line searches
• A restricted trust region algorithm for unconstrained optimization
• A new three-term conjugate gradient method
• A new class of supermemory gradient methods

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

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