Pages that link to "Item:Q4835475"

The following pages link to A Subspace Study on Conjugate Gradient Algorithms (Q4835475):

Displaying 30 items.

• New hybrid conjugate gradient method for unconstrained optimization (Q278565) (← links)
• A three-term derivative-free projection method for nonlinear monotone system of equations (Q331805) (← links)
• A Barzilai-Borwein conjugate gradient method (Q341313) (← links)
• Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization (Q382920) (← links)
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
• A Riemannian subspace limited-memory SR1 trust region method (Q518140) (← links)
• Subspace methods for large scale nonlinear equations and nonlinear least squares (Q833458) (← links)
• A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations (Q870296) (← links)
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization (Q1681785) (← links)
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776) (← links)
• Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions (Q1789677) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← 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)
• New hybrid conjugate gradient method as a convex combination of LS and FR methods (Q2150719) (← 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 adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q2240113) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
• A subspace SQP method for equality constrained optimization (Q2322557) (← links)
• On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
• A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization (Q2413500) (← links)
• An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
• A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
• Subspace Methods in Multi-Parameter Seismic Full Waveform Inversion (Q5162281) (← links)
• A three-term conjugate gradient method with a random parameter for large-scale unconstrained optimization and its application in regression model (Q6137748) (← 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)
• An overview of nonlinear optimization (Q6200213) (← links)