The following pages link to (Q5197276):
Displaying 27 items.
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems (Q354989) (← links)
- On the sufficient descent condition of the Hager-Zhang conjugate gradient methods (Q483732) (← links)
- A simple sufficient descent method for unconstrained optimization (Q613840) (← links)
- A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
- A linearly convergent conjugate gradient method for unconstrained optimization problems (Q763691) (← links)
- Sufficient descent nonlinear conjugate gradient methods with conjugacy condition (Q849150) (← 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)
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
- A conjugate gradient method with global convergence for large-scale unconstrained optimization problems (Q1790099) (← links)
- A new CG algorithm based on a scaled memoryless BFGS update with adaptive search strategy, and its application to large-scale unconstrained optimization problems (Q2043170) (← links)
- A new conjugate gradient projection method for convex constrained nonlinear equations (Q2205252) (← links)
- Two modified DY conjugate gradient methods for unconstrained optimization problems (Q2293925) (← links)
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations (Q2297154) (← links)
- Sufficient descent conjugate gradient methods for large-scale optimization problems (Q2885559) (← links)
- A scaled conjugate gradient method for nonlinear unconstrained optimization (Q4594847) (← links)
- Approximate norm descent methods for constrained nonlinear systems (Q4605702) (← links)
- (Q4995901) (← links)
- A conjugate gradient method with sufficient descent and global convergence for unconstrained nonlinear optimization (Q5198369) (← links)
- A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
- The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches (Q5948829) (← links)
- A modified nonlinear conjugate gradient algorithm for unconstrained optimization and portfolio selection problems (Q6045045) (← links)
- A nonlinear conjugate gradient method using inexact first-order information (Q6051169) (← links)
- A new conjugate gradient method for unconstrained optimization with sufficient descent (Q6051818) (← links)
- A new conjugate gradient method for the optimization problem with \(l_1\)-norm (Q6654110) (← links)
- An efficient modified conjugate gradient algorithm under Wolfe conditions with applications in compressive sensing (Q6664837) (← links)
- A subspace derivative-free projection method for convex constrained nonlinear equations (Q6671890) (← links)
