A modified form of conjugate gradient method for unconstrained optimization problems

DOI10.1063/1.4952556MaRDI QIDQ4989296zbMATH OpenOpenAlexFDO

Authors Nur Hamizah Abdul Ghani, Mohd Rivaie, Mustafa Mamat

Publication date 21 May 2021

Published in AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.4952556

zbMATH Keywords

sufficient descent condition, global convergence

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• A new conjugate gradient method for unconstrained optimization
• A modified conjugate gradient method for unconstrained optimization
• New conjugate gradient-like methods for unconstrained optimization
• A new modification of nonlinear conjugate gradient formula
• scientific article; zbMATH DE number 5927317

Cites work

• scientific article; zbMATH DE number 3501416 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches
• An unconstrained optimization test functions collection
• Benchmarking optimization software with performance profiles.
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• The conjugate gradient method in extremal problems

Cited in

(12)

• scientific article; zbMATH DE number 2063453 (Why is no real title available?)
• A conjugate gradient method based on a modified secant relation for unconstrained optimization
• Two modified DY conjugate gradient methods for unconstrained optimization problems
• Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
• Another modified version of RMIL conjugate gradient method
• Some modified conjugate gradient methods for unconstrained optimization
• Two modified conjugate gradient methods for solving unconstrained optimization and application
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
• A new conjugate gradient method for unconstrained optimization
• A modified Newton direction for unconstrained optimization
• Comparison between BZAU, SRMI and MRM conjugate gradient methods in minimization problems
• Another modified DPRP conjugate gradient method with global convergent properties

This page was built for publication: A modified form of conjugate gradient method for unconstrained optimization problems

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