A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model

DOI10.11650/TJM/230503MaRDI QIDQ6137748zbMATH OpenOpenAlexFDO

Authors Yueting Yang, Xue Zhang, Guoling Zhou, Mingyuan Cao

Publication date 16 January 2024

Published in Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.11650/tjm/230503

zbMATH Keywords

regression modelglobal convergencethree-term conjugate gradientlarge-scale unconstrained optimizationrandom parameter

Mathematics Subject Classification ID

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

Recommendations

• A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
• A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A new three-term conjugate gradient algorithm for unconstrained optimization
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems

Cites work

• A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
• A Subspace Study on Conjugate Gradient Algorithms
• A descent family of Dai-Liao conjugate gradient methods
• A descent hybrid conjugate gradient method based on the memoryless BFGS update
• A new accelerated conjugate gradient method for large-scale unconstrained optimization
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization
• An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
• An inexact accelerated stochastic ADMM for separable convex optimization
• Benchmarking optimization software with performance profiles.
• CUTEr and SifDec
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Nonlinear conjugate gradient methods for unconstrained optimization
• Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
• Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
• Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
• Sufficient descent Riemannian conjugate gradient methods
• Technical Note—A Modified Conjugate Gradient Algorithm
• The new spectral conjugate gradient method for large-scale unconstrained optimisation
• Two new conjugate gradient methods based on modified secant equations

Cited in

(1)

• A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem

This page was built for publication: A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model

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