A Two-Term PRP-Based Descent Method
From MaRDI portal
Publication:5438278
DOI10.1080/01630560701749524zbMath1138.90028OpenAlexW2094175538MaRDI QIDQ5438278
Publication date: 23 January 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560701749524
Related Items
A Polak-Ribière-Polyak method for solving large-scale nonlinear systems of equations and its global convergence ⋮ An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems ⋮ A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems ⋮ A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations ⋮ New conjugate gradient-like methods for unconstrained optimization ⋮ A descent extension of the Polak-Ribière-Polyak conjugate gradient method ⋮ A simple sufficient descent method for unconstrained optimization ⋮ A nonlinear conjugate gradient method using inexact first-order information ⋮ A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ A new descent memory gradient method and its global convergence ⋮ Nonmonotone spectral method for large-scale symmetric nonlinear equations ⋮ Modified Dai-Zuan iterative scheme for nonlinear systems and its application ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ A descent family of the spectral Hestenes–Stiefel method by considering the quasi-Newton method ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping ⋮ A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ 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 accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems ⋮ A new method with sufficient descent property for unconstrained optimization ⋮ New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search ⋮ 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 modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations ⋮ An Liu-Storey-Type Method for Solving Large-Scale Nonlinear Monotone Equations ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ A modified CG-DESCENT method for unconstrained optimization ⋮ A globally convergent derivative-free method for solving large-scale nonlinear monotone equations ⋮ A modified nonlinear conjugate gradient method with the Armijo line search and its application ⋮ A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations ⋮ 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 sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization ⋮ On three-term conjugate gradient algorithms for unconstrained optimization ⋮ A new three-term conjugate gradient algorithm for unconstrained optimization ⋮ Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations ⋮ A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem ⋮ 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 ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations ⋮ The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems ⋮ A new descent spectral Polak-Ribière-Polyak method based on the memoryless BFGS update ⋮ A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method ⋮ A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization ⋮ AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION ⋮ A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION ⋮ Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property ⋮ Globally convergent diagonal Polak-Ribière-Polyak like algorithm for nonlinear equations ⋮ The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems ⋮ A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS ⋮ Three derivative-free projection methods for nonlinear equations with convex constraints
Cites Work
- On the limited memory BFGS method for large scale optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- Convergence Properties of Algorithms for Nonlinear Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 851
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The conjugate gradient method in extremal problems
- Benchmarking optimization software with performance profiles.
