Pages that link to "Item:Q1757395"
From MaRDI portal
The following pages link to Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395):
Displaying 24 items.
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions (Q276855) (← links)
- A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search (Q2079812) (← links)
- A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction (Q2091131) (← links)
- Two classes of spectral conjugate gradient methods for unconstrained optimizations (Q2103158) (← links)
- Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems (Q2103178) (← links)
- Two spectral conjugate gradient methods for unconstrained optimization problems (Q2103183) (← links)
- An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems (Q2104056) (← links)
- An online conjugate gradient algorithm for large-scale data analysis in machine learning (Q2131556) (← links)
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
- Two new conjugate gradient methods for unconstrained optimization (Q2179153) (← links)
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
- Two modified DY conjugate gradient methods for unconstrained optimization problems (Q2293925) (← links)
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation (Q2297152) (← links)
- A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
- (Q4980479) (← links)
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization (Q5058391) (← links)
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations (Q6047884) (← links)
- (Q6097284) (← links)
- A class of CG algorithms overcoming jamming of the iterative solving process and its application in image restoration (Q6489243) (← links)
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems (Q6578180) (← links)
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization (Q6642792) (← links)
- A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications (Q6655474) (← links)