Pages that link to "Item:Q1029371"

The following pages link to Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371):

Displaying 40 items.

• On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
• A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
• Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
• Global convergence of a modified spectral conjugate gradient method (Q411054) (← links)
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
• An adaptive conjugate gradient algorithm for large-scale unconstrained optimization (Q495053) (← links)
• An accelerated double step size model in unconstrained optimization (Q902839) (← links)
• Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785) (← links)
• Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
• A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues (Q1744053) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization (Q2125037) (← links)
• A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization (Q2129634) (← links)
• Diagonal approximation of the Hessian by finite differences for unconstrained optimization (Q2188948) (← links)
• A class of accelerated conjugate-gradient-like methods based on a modified secant equation (Q2190281) (← links)
• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• Accelerated diagonal gradient-type method for large-scale unconstrained optimization (Q2228737) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization (Q2267641) (← links)
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
• A scaled three-term conjugate gradient method for unconstrained optimization (Q2374196) (← links)
• Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
• Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
• A modified conjugate gradient method based on the self-scaling memoryless BFGS update (Q2672717) (← links)
• A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem (Q2688917) (← links)
• A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization (Q2957702) (← links)
• A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization (Q3111146) (← links)
• Objective acceleration for unconstrained optimization (Q3120319) (← links)
• Convex Synthesis of Accelerated Gradient Algorithms (Q5020736) (← links)
• An accelerated conjugate gradient algorithm with guaranteed descent and conjugacy conditions for unconstrained optimization (Q5200551) (← links)
• Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization (Q5268936) (← links)
• Accelerated gradient descent methods with line search (Q5961879) (← links)
• Riemannian conjugate gradient method for low-rank tensor completion (Q6132849) (← links)
• An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration (Q6543751) (← links)
• An optimisation-based domain-decomposition reduced order model for parameter-dependent non-stationary fluid dynamics problems (Q6549892) (← links)
• A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration (Q6586095) (← links)