Accelerating procedures for methods of conjugate directions

DOI10.1007/BF02242308MaRDI QIDQ1217583zbMATH OpenOpenAlexFDO

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

Cites work

• A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems
• Alternative proofs of the convergence properties of the conjugate- gradient method
• An accelerated conjugate direction method to solve linearly constrained minimization problems
• Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
• scientific article; zbMATH DE number 3163006 (Why is no real title available?)
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3366717 (Why is no real title available?)
• scientific article; zbMATH DE number 3404055 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• Minimization of functions having Lipschitz continuous first partial derivatives
• Projection method for unconstrained optimization
• Rate of Convergence of Several Conjugate Gradient Algorithms

Cited in

(4)

• Accelerated conjugate direction methods for unconstrained optimization
• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• 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

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

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