Pages that link to "Item:Q3413523"
From MaRDI portal
The following pages link to A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence (Q3413523):
Displaying 50 items.
- Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
- Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping (Q2515036) (← links)
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition (Q2515111) (← links)
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations (Q2519689) (← links)
- A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
- Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems (Q2633254) (← links)
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem (Q2688917) (← links)
- A hybrid Riemannian conjugate gradient method for nonconvex optimization problems (Q2700130) (← links)
- A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems (Q2700161) (← links)
- A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization (Q2790872) (← links)
- A Riemannian Fletcher--Reeves Conjugate Gradient Method for Doubly Stochastic Inverse Eigenvalue Problems (Q2797100) (← links)
- Optimization for Inconsistent Split Feasibility Problems (Q2805985) (← links)
- A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
- A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method (Q2826665) (← links)
- A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS (Q2851122) (← links)
- A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization (Q2854330) (← links)
- Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
- New three-term conjugate gradient method with guaranteed global convergence (Q2935391) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems (Q2987782) (← links)
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065) (← links)
- Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property (Q3058361) (← links)
- A Trust Region Algorithm with Conjugate Gradient Technique for Optimization Problems (Q3083525) (← links)
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization (Q3111146) (← links)
- (Q3384741) (← links)
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems (Q3453426) (← links)
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization (Q3539795) (← links)
- An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method (Q4631766) (← links)
- A modified Hestense–Stiefel conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q4638925) (← links)
- A derivative-free three-term projection algorithm involving spectral quotient for solving nonlinear monotone equations (Q4646521) (← links)
- A family of quasi-Newton methods for unconstrained optimization problems (Q4646526) (← links)
- A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization (Q4899102) (← links)
- GLOBAL CONVERGENCE OF TWO KINDS OF THREE-TERM CONJUGATE GRADIENT METHODS WITHOUT LINE SEARCH (Q4921468) (← links)
- A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ<sub>1</sub>regularized problem (Q4999755) (← links)
- A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION (Q5011628) (← links)
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization (Q5028623) (← links)
- The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations (Q5031714) (← links)
- AN EFFICIENT METHOD FOR SOLVING A CLASS OF MATRIX TRACE FUNCTION MINIMIZATION PROBLEM IN MULTIVARIATE STATISTICAL (Q5051234) (← links)
- A new constrained optimization model for solving the nonsymmetric stochastic inverse eigenvalue problem (Q5051477) (← links)
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations (Q5063454) (← links)
- (Q5096532) (← links)
- (Q5096719) (← links)
- Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques (Q5112237) (← links)
- Projected Newton method for noise constrained ℓ <sub> p </sub> regularization (Q5139326) (← links)
- A fast conjugate gradient algorithm with active set prediction for ℓ<sub>1</sub> optimization (Q5238070) (← links)
- A NEW DERIVATIVE-FREE CONJUGATE GRADIENT METHOD FOR LARGE-SCALE NONLINEAR SYSTEMS OF EQUATIONS (Q5269727) (← links)