Pages that link to "Item:Q1036299"

The following pages link to Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299):

Displaying 32 items.

• On three-term conjugate gradient algorithms for unconstrained optimization (Q120733) (← links)
• A new three-term conjugate gradient algorithm for unconstrained optimization (Q120735) (← links)
• A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
• A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems (Q354989) (← links)
• Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization (Q357379) (← links)
• Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization (Q380494) (← links)
• Global convergence of a nonlinear conjugate gradient method (Q410397) (← links)
• A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization (Q421813) (← links)
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization (Q457047) (← links)
• On the sufficient descent condition of the Hager-Zhang conjugate gradient methods (Q483732) (← links)
• A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems (Q489124) (← links)
• A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
• Global convergence of some modified PRP nonlinear conjugate gradient methods (Q644512) (← links)
• A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations (Q667882) (← links)
• Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← links)
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems (Q849738) (← links)
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization (Q883860) (← links)
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems (Q1001321) (← links)
• Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization (Q1722397) (← links)
• A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence (Q1722876) (← links)
• Adaptive three-term family of conjugate residual methods for system of monotone nonlinear equations (Q2107668) (← links)
• DTSMA: dominant swarm with adaptive T-distribution mutation-based slime mould algorithm (Q2130300) (← links)
• Spectral three-term constrained conjugate gradient algorithm for function minimizations (Q2294136) (← links)
• Some three-term conjugate gradient methods with the new direction structure (Q2301307) (← links)
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence (Q2421741) (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
• Descent symmetrization of the Dai-Liao conjugate gradient method (Q2809315) (← links)
• Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
• (Q4995901) (← links)
• (Q5197276) (← links)
• A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization (Q5198369) (← links)
• Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution (Q6071888) (← links)