A modified CG-DESCENT method for unconstrained optimization

DOI10.1016/J.CAM.2011.01.046zbMATH Open1231.90343OpenAlexW2059598572MaRDI QIDQ535462FDOQ535462

Authors Zhifeng Dai, Fenghua Wen

Publication date 11 May 2011

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2011.01.046

zbMATH Keywords

CG-DESCENTconjugate gradient method, global convergenceunconstrainted optimization

Mathematics Subject Classification ID

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

Recommendations

• A modified CG-DESCENT and DPR algorithm for unconstrained optimization
• A modified Polak-Ribière-Polyak descent method for unconstrained optimization
• An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties
• Global convergence of a modified PRP conjugate gradient method and its numerical results
• A modified conjugate gradient method with sufficient condition and conjugacy condition

Cites work

• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Two-Term PRP-Based Descent Method
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Benchmarking optimization software with performance profiles.
• CUTE
• Convergence Conditions for Ascent Methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• The conjugate gradient method in extremal problems

Cited in

(10)

• Some new fractional integral inequalities for exponentially \(m\)-convex functions via extended generalized Mittag-Leffler function
• Experiments with search directions for a generalized CG method
• Descent line search scheme using Geršgorin circle theorem
• Another modified version of RMIL conjugate gradient method
• A modified Perry conjugate gradient method and its global convergence
• A note on generalized convex functions
• Hermite-Hadamard type inequalities for co-ordinated convex and qausi-convex functions and their applications
• Optimal two-parameter geometric and arithmetic mean bounds for the Sándor-Yang mean
• A limited memory descent Perry conjugate gradient method
• A modified CG-DESCENT and DPR algorithm for unconstrained optimization

Describes a project that uses

Uses Software

• CUTEr
• CUTE

This page was built for publication: A modified CG-DESCENT method for unconstrained optimization

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