Global convergence of conjugate gradient methods without line search
From MaRDI portal
Publication:5959294
DOI10.1023/A:1012903105391zbMath1014.90071MaRDI QIDQ5959294
Publication date: 26 March 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (43)
An ODE-based trust region method for unconstrained optimization problems ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search ⋮ Unnamed Item ⋮ Convergence of the Polak-Ribiére-Polyak conjugate gradient method ⋮ The convergence of conjugate gradient method with nonmonotone line search ⋮ Convergence of Liu-Storey conjugate gradient method ⋮ A descent nonlinear conjugate gradient method for large-scale unconstrained optimization ⋮ A new class of nonlinear conjugate gradient coefficients with global convergence properties ⋮ The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems ⋮ Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search ⋮ GLOBAL CONVERGENCE OF A SPECIAL CASE OF THE DAI–YUAN FAMILY WITHOUT LINE SEARCH ⋮ Convergence of conjugate gradient methods with a closed-form stepsize formula ⋮ A modified conjugacy condition and related nonlinear conjugate gradient method ⋮ A new gradient method via least change secant update ⋮ A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches ⋮ Global convergence of a modified spectral FR conjugate gradient method ⋮ Some remarks on conjugate gradient methods without line search ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ CONVERGENCE PROPERTY AND MODIFICATIONS OF A MEMORY GRADIENT METHOD ⋮ A hybrid ODE-based method for unconstrained optimization problems ⋮ GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH ⋮ Global convergence of a two-parameter family of conjugate gradient methods without line search ⋮ A new hybrid method for nonlinear complementarity problems ⋮ Quadratic cost flow and the conjugate gradient method ⋮ Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems ⋮ Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems ⋮ Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils ⋮ A note about WYL's conjugate gradient method and its applications ⋮ A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling ⋮ Modified Hestenes-Steifel conjugate gradient coefficient for unconstrained optimization ⋮ A nonmonotone conic trust region method based on line search for solving unconstrained optimization ⋮ A globally convergent BFGS method for nonconvex minimization without line searches ⋮ A new family of conjugate gradient methods ⋮ Convergence of conjugate gradient methods with constant stepsizes ⋮ A modified PRP conjugate gradient method ⋮ A new trust region method with adaptive radius ⋮ Penalty algorithm based on conjugate gradient method for solving portfolio management problem ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ⋮ A descent algorithm without line search for unconstrained optimization ⋮ A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics ⋮ Convergence of descent method without line search ⋮ A nonmonotone trust region method for unconstrained optimization
This page was built for publication: Global convergence of conjugate gradient methods without line search
