Pages that link to "Item:Q2433993"

The following pages link to Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993):

Displaying 50 items.

• A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations (Q1751397) (← links)
• Conjugate gradient methods using value of objective function for unconstrained optimization (Q1758034) (← links)
• Global convergence of the Fletcher-Reeves algorithm with inexact linesearch (Q1891684) (← links)
• A new descent memory gradient method and its global convergence (Q1937779) (← links)
• A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing (Q2004234) (← links)
• A scaled three-term conjugate gradient method for large-scale unconstrained optimization problem (Q2009756) (← links)
• Some nonlinear conjugate gradient methods based on spectral scaling secant equations (Q2013630) (← links)
• A class of modified FR conjugate gradient method and applications to non-negative matrix factorization (Q2013810) (← links)
• A spectral three-term Hestenes-Stiefel conjugate gradient method (Q2040607) (← links)
• Modified HS conjugate gradient method for solving generalized absolute value equations (Q2067787) (← links)
• Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
• The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
• Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems (Q2076422) (← links)
• A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
• Global convergence of Riemannian line search methods with a Zhang-Hager-type condition (Q2084256) (← links)
• Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems (Q2088792) (← 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)
• A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions (Q2103175) (← links)
• Two spectral conjugate gradient methods for unconstrained optimization problems (Q2103183) (← links)
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing (Q2142552) (← links)
• A modified Dai-Kou-type method with applications to signal reconstruction and blurred image restoration (Q2167359) (← links)
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
• Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei (Q2181673) (← links)
• A spectral conjugate gradient method for solving large-scale unconstrained optimization (Q2203770) (← links)
• Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems (Q2209686) (← links)
• PRP-like algorithm for monotone operator equations (Q2231600) (← links)
• Extrapolated sequential constraint method for variational inequality over the intersection of fixed-point sets (Q2234474) (← links)
• Convergence properties of an iterative method for solving symmetric non-linear equations (Q2260665) (← links)
• Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations (Q2286033) (← links)
• A class of derivative-free CG projection methods for nonsmooth equations with an application to the LASSO problem (Q2287031) (← links)
• A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations (Q2297154) (← links)
• Modified three-term conjugate gradient method and its applications (Q2298600) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• A conjugate gradient algorithm and its applications in image restoration (Q2301430) (← links)
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
• A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• A conjugate gradient type method for the nonnegative constraints optimization problems (Q2375742) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• Two descent hybrid conjugate gradient methods for optimization (Q2483351) (← links)
• Nonstationary iterated Tikhonov regularization in Banach spaces with uniformly convex penalty terms (Q2510402) (← 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 Riemannian Fletcher-Reeves conjugate gradient method for doubly stochastic inverse eigenvalue problems (Q2797100) (← links)
• A sufficient descent Liu–Storey conjugate gradient method and its global convergence (Q2808326) (← links)
• A modified projected conjugate gradient algorithm for unconstrained optimization problems (Q2851122) (← links)
• Global convergence of a modified FR conjugate gradient method (Q2887859) (← links)