Pages that link to "Item:Q1730776"

The following pages link to An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization (Q1730776):

Displaying 32 items.

• A Barzilai-Borwein conjugate gradient method (Q341313) (← links)
• A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
• A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
• A dynamical view of nonlinear conjugate gradient methods with applications to FFT-based computational micromechanics (Q785497) (← links)
• A new adaptive Barzilai and Borwein method for unconstrained optimization (Q1653281) (← links)
• A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
• BARON: A general purpose global optimization software package (Q1924072) (← 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)
• An extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← 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)
• A conjugate gradient method for distributed optimal control problems with nonhomogeneous Helmholtz equation (Q2242755) (← links)
• Two modified DY conjugate gradient methods for unconstrained optimization problems (Q2293925) (← links)
• A modified spectral conjugate gradient method with global convergence (Q2317848) (← links)
• A subspace minimization conjugate gradient method based on conic model for unconstrained optimization (Q2322338) (← links)
• An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization (Q2420801) (← links)
• \(R\)-linear convergence of the Barzilai and Borwein gradient method (Q2783762) (← links)
• A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems (Q2804916) (← links)
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem (Q3124034) (← links)
• Direct search conjugate gradient method based on adaptive Barzilai-Borwein step-size (Q3131693) (← links)
• A Direct Search Frame-Based Adaptive Barzilai-Borwein Method (Q3194432) (← links)
• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization (Q4631773) (← links)
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice (Q4632353) (← links)
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
• An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization (Q5277958) (← links)
• A modified four-term extension of the Dai-Liao conjugate gradient method (Q6086969) (← 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 efficient inertial subspace minimization CG algorithm with convergence rate analysis for constrained nonlinear monotone equations (Q6567299) (← links)
• A subspace derivative-free projection method for convex constrained nonlinear equations (Q6671890) (← links)