Pages that link to "Item:Q2406313"

The following pages link to Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization (Q2406313):

Displaying 13 items.

• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← 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)
• A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization (Q2140823) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← 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)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• Structured two-point stepsize gradient methods for nonlinear least squares (Q2420782) (← links)
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
• Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application (Q2423608) (← links)
• An extremal problem with applications to renewable energy production (Q5001087) (← links)
• A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)