Pages that link to "Item:Q2515066"

The following pages link to A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066):

Displaying 28 items.

• A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints (Q295355) (← links)
• A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations (Q824565) (← links)
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
• On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization (Q1652787) (← links)
• Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search (Q1667567) (← links)
• A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• Least-squares-based three-term conjugate gradient methods (Q2069298) (← links)
• Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems (Q2076422) (← links)
• A new smoothing spectral conjugate gradient method for solving tensor complementarity problems (Q2171089) (← links)
• A distributed conjugate gradient online learning method over networks (Q2173726) (← links)
• Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei (Q2181673) (← links)
• Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration (Q2202438) (← links)
• Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery (Q2211072) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• A conjugate gradient projection method for solving equations with convex constraints (Q2309250) (← links)
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence (Q2421741) (← links)
• A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems (Q2628168) (← links)
• Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint (Q3383893) (← links)
• (Q3384266) (← 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 truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (Q6086842) (← links)
• A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems (Q6099495) (← links)
• A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems (Q6156109) (← links)
• Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization (Q6161550) (← links)
• Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods (Q6169313) (← links)
• A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations (Q6173013) (← links)