A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
From MaRDI portal
Publication:3413523
DOI10.1093/imanum/drl016zbMath1106.65056MaRDI QIDQ3413523
Weijun Zhou, Li Zhang, Dong-hui Li
Publication date: 12 December 2006
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/drl016
65K05: Numerical mathematical programming methods
65F10: Iterative numerical methods for linear systems
90C52: Methods of reduced gradient type
Related Items
On three-term conjugate gradient algorithms for unconstrained optimization, A new three-term conjugate gradient algorithm for unconstrained optimization, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, A Polak-Ribière-Polyak method for solving large-scale nonlinear systems of equations and its global convergence, Convergence properties of a class of nonlinear conjugate gradient methods, A Barzilai-Borwein conjugate gradient method, Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization, A short note on the global convergence of the unmodified PRP method, An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems, Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations, A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization, The convergence rate of a restart MFR conjugate gradient method with inexact line search, Global convergence of a nonlinear conjugate gradient method, Global convergence of a modified spectral conjugate gradient method, Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization, Comments on: ``A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations, An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization, Norm descent conjugate gradient methods for solving symmetric nonlinear equations, Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence, A limited memory descent Perry conjugate gradient method, A modified three-term PRP conjugate gradient algorithm for optimization models, A modified three-term conjugate gradient method with sufficient descent property, A modified CG-DESCENT method for unconstrained optimization, A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization, New spectral PRP conjugate gradient method for unconstrained optimization, A simple sufficient descent method for unconstrained optimization, Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping, \(n\)-step quadratic convergence of the MPRP method with a restart strategy, Global convergence of some modified PRP nonlinear conjugate gradient methods, Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions, Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search, A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations, New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction, FR type methods for systems of large-scale nonlinear monotone equations, A new class of nonmonotone conjugate gradient training algorithms, A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations, Some three-term conjugate gradient methods with the inexact line search condition, A norm descent derivative-free algorithm for solving large-scale nonlinear symmetric equations, A conjugate gradient method with descent direction for unconstrained optimization, A nonmonotone supermemory gradient algorithm for unconstrained optimization, A conjugate gradient method with sufficient descent property, Sufficient descent nonlinear conjugate gradient methods with conjugacy condition, A new conjugate gradient algorithm for training neural networks based on a modified secant equation, A conjugate gradient method for unconstrained optimization problems, A globally convergent derivative-free method for solving large-scale nonlinear monotone equations, Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems, A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems, A limited memory BFGS-type method for large-scale unconstrained optimization, Two modified Dai-Yuan nonlinear conjugate gradient methods, A modified PRP conjugate gradient method, Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization, An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation, An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method, A PRP-based residual method for large-scale monotone nonlinear equations, Two accelerated nonmonotone adaptive trust region line search methods, Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme, A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization, An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints, An improved three-term derivative-free method for solving nonlinear equations, A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization, Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization, A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models, A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems, Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization, A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence, On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method, A globally convergent matrix-free method for constrained equations and its linear convergence rate, A new method with sufficient descent property for unconstrained optimization, New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods, A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations, Conjugate gradient methods using value of objective function for unconstrained optimization, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, A new descent memory gradient method and its global convergence, Nonmonotone spectral method for large-scale symmetric nonlinear equations, Conjugate gradient type methods for the nondifferentiable convex minimization, The global convergence of a new mixed conjugate gradient method for unconstrained optimization, Identification of random dynamic force using an improved maximum entropy regularization combined with a novel conjugate gradient, A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem, A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems, Some nonlinear conjugate gradient methods based on spectral scaling secant equations, A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods, A practical PR+ conjugate gradient method only using gradient, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, Convergence properties of an iterative method for solving symmetric non-linear equations, An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems, Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm, A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem, A modified spectral PRP conjugate gradient projection method for solving large-scale monotone equations and its application in compressed sensing, Modified three-term conjugate gradient method and its applications, Dynamic force identification problem based on a novel improved Tikhonov regularization method, Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization, Some three-term conjugate gradient methods with the new direction structure, The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems, A conjugate gradient projection method for solving equations with convex constraints, A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method, Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property, A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations, An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method, A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method, A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations, A family of quasi-Newton methods for unconstrained optimization problems, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH, Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques, A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization, A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS, An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization, Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination, An Liu-Storey-Type Method for Solving Large-Scale Nonlinear Monotone Equations, Some descent three-term conjugate gradient methods and their global convergence, A Two-Term PRP-Based Descent Method, The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems, A Geometric Nonlinear Conjugate Gradient Method for Stochastic Inverse Eigenvalue Problems, A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization, On the convergence properties of the unmodified PRP method with a non-descent line search, A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence, A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition, A modified Perry conjugate gradient method and its global convergence, A scaled three-term conjugate gradient method for unconstrained optimization, A conjugate gradient type method for the nonnegative constraints optimization problems, A descent extension of the Polak-Ribière-Polyak conjugate gradient method, Global convergence of a modified conjugate gradient method, A new modified three-term conjugate gradient method with sufficient descent property and its global convergence, A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions, Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, A smoothing conjugate gradient method for solving systems of nonsmooth equations, Two descent hybrid conjugate gradient methods for optimization, Some sufficient descent conjugate gradient methods and their global convergence, Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping, A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization, A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition, A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations, A memory gradient method based on the nonmonotone technique, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems, A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization, A Riemannian Fletcher--Reeves Conjugate Gradient Method for Doubly Stochastic Inverse Eigenvalue Problems, Optimization for Inconsistent Split Feasibility Problems, A sufficient descent Liu–Storey conjugate gradient method and its global convergence, A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method, A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS, A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization, Sufficient descent conjugate gradient methods for large-scale optimization problems, New three-term conjugate gradient method with guaranteed global convergence, Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition, A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems, A Modified PRP Conjugate Gradient Algorithm with Trust Region for 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, Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property, A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems, A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization, An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems, Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
Uses Software
