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 41 items.
- Improving the Dai-Liao parameter choices using a fixed point equation (Q5080095) (← links)
- Global convergence of a modified Fletcher–Reeves conjugate gradient method with Wolfe line search (Q5113081) (← links)
- An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization (Q5200551) (← links)
- A new spectral conjugate gradient method for large-scale unconstrained optimization (Q5268934) (← links)
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization (Q5268936) (← links)
- Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination (Q5277965) (← links)
- A gradient projection method for the sparse signal reconstruction in compressive sensing (Q5375935) (← links)
- A modified Hestenes–Stiefel conjugate gradient method with an optimal property (Q5379461) (← links)
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q5436920) (← links)
- Two hybrid nonlinear conjugate gradient methods based on a modified secant equation (Q5495572) (← links)
- A modified Polak–Ribi‘<i>e</i>re–Polyak descent method for unconstrained optimization (Q5746691) (← links)
- A descent family of Dai–Liao conjugate gradient methods (Q5746716) (← links)
- A modified conjugate gradient method based on a modified secant equation (Q5855677) (← links)
- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters (Q5855678) (← links)
- A one-parameter class of three-term conjugate gradient methods with an adaptive parameter choice (Q5858994) (← links)
- An efficient adaptive scaling parameter for the spectral conjugate gradient method (Q5963695) (← links)
- A new efficient conjugate gradient method for unconstrained optimization (Q5964605) (← links)
- Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising (Q6039498) (← links)
- An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems (Q6049271) (← links)
- A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems (Q6064895) (← links)
- Two diagonal conjugate gradient like methods for unconstrained optimization (Q6065141) (← links)
- A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications (Q6076928) (← links)
- A new sufficiently descent algorithm for pseudomonotone nonlinear operator equations and signal reconstruction (Q6076932) (← links)
- A modified four-term extension of the Dai-Liao conjugate gradient method (Q6086969) (← links)
- (Q6097284) (← links)
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems (Q6098978) (← links)
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems (Q6099495) (← links)
- New spectral LS conjugate gradient method for nonlinear unconstrained optimization (Q6106715) (← links)
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing (Q6109887) (← links)
- Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization (Q6110199) (← links)
- An adaptive modified three-term conjugate gradient method with global convergence (Q6114062) (← links)
- A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model (Q6137748) (← links)
- A family of the modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent and conjugacy conditions (Q6138348) (← links)
- A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems (Q6138360) (← links)
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM (Q6142230) (← links)
- On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications (Q6150644) (← links)
- A new subspace minimization conjugate gradient method for unconstrained minimization (Q6150649) (← links)
- A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems (Q6156109) (← links)
- A restart scheme for the memoryless BFGS method (Q6169212) (← links)
- An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms (Q6186565) (← links)
- An overview of nonlinear optimization (Q6200213) (← links)