New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods

DOI10.1007/s10957-018-1324-3zbMath1409.90193OpenAlexW2808289429WikidataQ129702857 ScholiaQ129702857MaRDI QIDQ1730830

Predrag S. Stanimirović, Branislav Ivanov, Ivona Brajević, Snežana S. Djordjević

Publication date: 6 March 2019

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

Full work available at URL: https://doi.org/10.1007/s10957-018-1324-3

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodsquasi-Newton methodsbacktracking line search

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (5)

Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising ⋮ An inertial spectral CG projection method based on the memoryless BFGS update ⋮ A Dai-Liao-type projection method for monotone nonlinear equations and signal processing ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ A survey of gradient methods for solving nonlinear optimization

Cites Work

• Efficient generalized conjugate gradient algorithms. I: Theory
• Efficient hybrid conjugate gradient techniques
• Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems
• The hybrid BFGS-CG method in solving unconstrained optimization problems
• A global convergence of LS-CD hybrid conjugate gradient method
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Two descent hybrid conjugate gradient methods for optimization
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• A Two-Term PRP-Based Descent Method
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Accelerated gradient descent methods with line search
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods