Pages that link to "Item:Q1681785"

The following pages link to A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785):

Displaying 24 items.

• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
• A new subspace correction method for nonlinear unconstrained convex optimization problems (Q692728) (← links)
• A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models (Q1720966) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• Subspace trust-region algorithm with conic model for unconstrained optimization (Q1953148) (← links)
• A three-term conjugate gradient algorithm using subspace for large-scale unconstrained optimization (Q2023548) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems (Q2098802) (← links)
• A class of accelerated subspace minimization conjugate gradient methods (Q2231338) (← links)
• Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization (Q2299208) (← links)
• Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization (Q2301133) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• The substitution secant/finite difference method for large scale sparse unconstrained optimization (Q2508054) (← links)
• A trust region subspace method for large-scale unconstrained optimization (Q2920366) (← links)
• An improved three-dimensional subspace minimization conjugate gradient method (Q3385871) (← links)
• (Q3730342) (← links)
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
• A regularized limited memory subspace minimization conjugate gradient method for unconstrained optimization (Q6141538) (← links)
• A new subspace minimization conjugate gradient method for unconstrained minimization (Q6150649) (← links)
• A three-term gradient descent method with subspace techniques (Q6483838) (← links)
• A subspace derivative-free projection method for convex constrained nonlinear equations (Q6671890) (← links)