Pages that link to "Item:Q5929889"
From MaRDI portal
The following pages link to New conjugacy conditions and related nonlinear conjugate gradient methods (Q5929889):
Displayed 50 items.
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method (Q2400710) (← links)
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
- A descent Dai-Liao conjugate gradient method for nonlinear equations (Q2414704) (← links)
- A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (Q2424224) (← links)
- Scaled conjugate gradient algorithms for unconstrained optimization (Q2477015) (← links)
- Another hybrid conjugate gradient algorithm for unconstrained optimization (Q2481406) (← links)
- Some sufficient descent conjugate gradient methods and their global convergence (Q2514055) (← links)
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← 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 class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
- Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach (Q2664762) (← links)
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems (Q2671105) (← links)
- Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring (Q2687442) (← links)
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem (Q2688917) (← links)
- A modified conjugate gradient method for general convex functions (Q2699981) (← 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 Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
- A sufficient descent conjugate gradient method and its global convergence (Q2815547) (← 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)
- A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter (Q2868907) (← links)
- Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
- New conjugate gradient-like methods for unconstrained optimization (Q2926084) (← links)
- A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition (Q2969958) (← links)
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization (Q3111146) (← links)
- A nonlinear conjugate gradient method based on the MBFGS secant condition (Q3423590) (← links)
- Two optimal Dai–Liao conjugate gradient methods (Q3453402) (← links)
- An improved three-term conjugate gradient algorithm for solving unconstrained optimization problems (Q3453426) (← links)
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach (Q3458811) (← links)
- A new class of efficient and globally convergent conjugate gradient methods in the Dai–Liao family (Q3458820) (← links)
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization (Q3514834) (← 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 new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization (Q4631773) (← links)
- A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice (Q4632353) (← 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 Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization (Q4959904) (← links)
- MATRIX ANALYSES ON THE DAI–LIAO CONJUGATE GRADIENT METHOD (Q4966642) (← links)
- A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION (Q5011628) (← links)
- An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems (Q5014270) (← links)
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← 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)
- A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization (Q5043843) (← links)
- An efficient hybrid conjugate gradient method for unconstrained optimization (Q5058378) (← links)