Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
From MaRDI portal
Publication:538032
zbMath1225.49030MaRDI QIDQ538032
Publication date: 23 May 2011
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/244368
Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Methods of quasi-Newton type (90C53)
Related Items (55)
A hybrid scaling parameter for the scaled memoryless BFGS method based on the ℓ∞ matrix norm ⋮ An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A modified scaling parameter for the memoryless BFGS updating formula ⋮ A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method ⋮ Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems ⋮ A new class of nonlinear conjugate gradient coefficients with global convergence properties ⋮ On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ Two families of hybrid conjugate gradient methods with restart procedures and their applications ⋮ Optimization of unconstrained problems using a developed algorithm of spectral conjugate gradient method calculation ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ Global convergence of a modified spectral conjugate gradient method ⋮ On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ A restart scheme for the memoryless BFGS method ⋮ A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ Descent Perry conjugate gradient methods for systems of monotone nonlinear equations ⋮ A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function ⋮ Two modified three-term conjugate gradient methods with sufficient descent property ⋮ An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization ⋮ A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained 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 ⋮ A class of accelerated subspace minimization conjugate gradient methods ⋮ A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches ⋮ A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ Improving the Dai-Liao parameter choices using a fixed point equation ⋮ A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues ⋮ On optimality of two adaptive choices for the parameter of Dai-Liao method ⋮ A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update ⋮ A new family of conjugate gradient methods for unconstrained optimization ⋮ Two adaptive Dai-Liao nonlinear conjugate gradient methods ⋮ The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices ⋮ A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Descent Symmetrization of the Dai–Liao Conjugate Gradient Method ⋮ An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation ⋮ MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD ⋮ New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization ⋮ An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization ⋮ Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations ⋮ Two descent Dai-Yuan conjugate gradient methods for systems of monotone nonlinear equations ⋮ A new type of descent conjugate gradient method with exact line search ⋮ A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function ⋮ 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 ⋮ A new hybrid algorithm for convex nonlinear unconstrained optimization ⋮ A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations
Uses Software
This page was built for publication: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
