Pages that link to "Item:Q5408214"

The following pages link to The Limited Memory Conjugate Gradient Method (Q5408214):

Displaying 50 items.

• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
• Symmetric Perry conjugate gradient method (Q377723) (← links)
• A limited memory descent Perry conjugate gradient method (Q518141) (← links)
• Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods (Q523183) (← links)
• CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method (Q679580) (← links)
• On exact linesearch quasi-Newton methods for minimizing a quadratic function (Q683343) (← links)
• Exploiting damped techniques for nonlinear conjugate gradient methods (Q684134) (← links)
• A limited memory steepest descent method (Q715093) (← links)
• A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
• Speeding up the convergence of the Polyak's heavy ball algorithm (Q1643948) (← links)
• An improved Perry conjugate gradient method with adaptive parameter choice (Q1656676) (← links)
• Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search (Q1667567) (← links)
• A novel fractional Tikhonov regularization coupled with an improved super-memory gradient method and application to dynamic force identification problems (Q1720969) (← links)
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations (Q1723812) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming (Q1790671) (← links)
• An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem (Q2036061) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• A convexity enforcing \(C^0\) interior penalty method for the Monge-Ampère equation on convex polygonal domains (Q2049911) (← links)
• Truncated trust region method for nonlinear inverse problems and application in full-waveform inversion (Q2059653) (← links)
• A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property (Q2129100) (← links)
• An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
• Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei (Q2181673) (← links)
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization (Q2184373) (← links)
• New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method (Q2190791) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
• A novel method of dynamic force identification and its application (Q2298083) (← links)
• An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems (Q2340523) (← links)
• A modified Perry conjugate gradient method and its global convergence (Q2355321) (← links)
• An optimal subgradient algorithm for large-scale bound-constrained convex optimization (Q2408897) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
• A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization (Q2436686) (← links)
• A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
• A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066) (← links)
• A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems (Q2628168) (← links)
• A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems (Q2671105) (← links)
• Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems (Q3603656) (← links)
• An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method (Q4631766) (← links)
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice (Q4632353) (← links)
• Higher order curvature information and its application in a modified diagonal Secant method (Q4646553) (← links)
• (Q4963670) (← links)
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
• Inexact Newton-type methods based on Lanczos orthonormal method and application for full waveform inversion (Q5132267) (← links)