Pages that link to "Item:Q1751056"

The following pages link to An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization (Q1751056):

Displaying 28 items.

• Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization (Q370023) (← links)
• A new two-step gradient-type method for large-scale unconstrained optimization (Q604019) (← links)
• An improved multi-step gradient-type method for large scale optimization (Q640533) (← links)
• Scalar correction method for solving large scale unconstrained minimization problems (Q658551) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• An effective first order reliability method based on Barzilai-Borwein step (Q1988795) (← links)
• Stochastic gradient method with Barzilai-Borwein step for unconstrained nonlinear optimization (Q1995392) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• The new spectral conjugate gradient method for large-scale unconstrained optimisation (Q2069403) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← 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)
• Accelerated augmented Lagrangian method for total variation minimization (Q2322436) (← links)
• Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
• Gradient method with multiple damping for large-scale unconstrained optimization (Q2421450) (← links)
• Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points (Q5027014) (← links)
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
• An efficient gradient method with approximately optimal stepsizes based on regularization models for unconstrained optimization (Q5104613) (← links)
• (Q5493580) (← links)
• A hybrid BB-type method for solving large scale unconstrained optimization (Q6138335) (← links)
• A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)
• A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization (Q6593314) (← links)
• New gradient methods with adaptive stepsizes by approximate models (Q6611221) (← links)