A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues

DOI10.1007/s11075-017-0362-5OpenAlexW2625981504MaRDI QIDQ1744053

Neculai Andrei

Publication date: 16 April 2018

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-017-0362-5

zbMATH Keywords

unconstrained optimizationconvergencecondition numberWolfe conditionsconjugate gradient algorithmseigenvalues clustering

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (17)

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model ⋮ A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring ⋮ A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations ⋮ A modified conjugate gradient method for general convex functions ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ Discrete-time zeroing neural network of \(O(\tau^4)\) pattern for online solving time-varying nonlinear optimization problem: application to manipulator motion generation ⋮ Improving the Dai-Liao parameter choices using a fixed point equation ⋮ An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation ⋮ A modified spectral conjugate gradient method with global convergence ⋮ An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix

Uses Software

• CUTEr

Cites Work

• Unnamed Item
• Unnamed Item
• Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
• Block splittings for the conjugate gradient method
• On the real convergence rate of the conjugate gradient method
• Acceleration of conjugate gradient algorithms for unconstrained optimization
• On the rate of convergence of the preconditioned conjugate gradient method
• The rate of convergence of conjugate gradients
• A class of iterative methods for finite element equations
• On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
• Optimization theory and methods. Nonlinear programming
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• CUTE
• New convergence results and preconditioning strategies for the conjugate gradient method
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues