Pages that link to "Item:Q5964605"

The following pages link to A new efficient conjugate gradient method for unconstrained optimization (Q5964605):

Displaying 34 items.

• An optimal parameter for Dai-Liao family of conjugate gradient methods (Q289129) (← links)
• A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization (Q989146) (← links)
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition (Q1626534) (← links)
• General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization (Q1631443) (← links)
• Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (Q1653949) (← links)
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search (Q1757395) (← links)
• A new family of conjugate gradient methods for unconstrained optimization (Q1786950) (← links)
• A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems (Q2004127) (← links)
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
• A new accelerated conjugate gradient method for large-scale unconstrained optimization (Q2068094) (← links)
• A three-term conjugate gradient method with accelerated subspace quadratic optimization (Q2089194) (← links)
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems (Q2142484) (← links)
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization (Q2204182) (← links)
• Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting (Q2214465) (← links)
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction (Q2244998) (← links)
• Two modified DY conjugate gradient methods for unconstrained optimization problems (Q2293925) (← links)
• An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation (Q2297152) (← links)
• A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix (Q2336064) (← links)
• Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application (Q2402390) (← links)
• A modified conjugate gradient method for general convex functions (Q2699981) (← links)
• New conjugate gradient method for unconstrained optimization (Q2954367) (← links)
• (Q3017298) (← links)
• (Q3158025) (← links)
• A fast and robust unconstrained optimization method requiring minimum storage (Q3693274) (← links)
• (Q4702862) (← links)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization (Q5031726) (← links)
• A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization (Q5106116) (← links)
• Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination (Q5277965) (← links)
• A new conjugate gradient method for unconstrained optimization with sufficient descent (Q6051818) (← links)
• Solving unconstrained optimization with a new type of conjugate gradient method (Q6051840) (← links)
• A family of limited memory three term conjugate gradient methods (Q6661110) (← links)