Accelerating procedures for methods of conjugate directions

DOI10.1007/BF02242308zbMath0306.65039OpenAlexW2103136418MaRDI QIDQ1217583

S. Singh

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242308

Mathematics Subject Classification ID

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

Related Items (4)

Accelerated conjugate direction methods for unconstrained optimization ⋮ A quasi-Newton method can be obtained from a method of conjugate directions ⋮ Generating conjugate directions without line searches using factorized variable metric updating formulas ⋮ A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An accelerated conjugate direction method to solve linearly constrained minimization problems
• Minimization of functions having Lipschitz continuous first partial derivatives
• Projection method for unconstrained optimization
• Alternative proofs of the convergence properties of the conjugate- gradient method
• A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
• Rate of Convergence of Several Conjugate Gradient Algorithms
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm

This page was built for publication: Accelerating procedures for methods of conjugate directions