Pages that link to "Item:Q2570691"

The following pages link to Convergence of descent method without line search (Q2570691):

Displaying 16 items.

• Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method (Q508045) (← links)
• Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
• The convergence of conjugate gradient method with nonmonotone line search (Q606706) (← links)
• Scalar correction method for solving large scale unconstrained minimization problems (Q658551) (← links)
• A new class of nonmonotone conjugate gradient training algorithms (Q669374) (← links)
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
• Convergence of Liu-Storey conjugate gradient method (Q881512) (← links)
• Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
• A new trust region method with adaptive radius (Q1029622) (← links)
• A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
• A study of Liu-Storey conjugate gradient methods for vector optimization (Q2139818) (← links)
• On step-size estimation of line search methods (Q2489176) (← links)
• An ODE-based nonmonotone method for unconstrained optimization problems (Q2511365) (← links)
• A new family of conjugate gradient methods (Q2519734) (← links)
• A Hybridizable Discontinuous Galerkin Method for the $p$-Laplacian (Q2790076) (← links)
• Global convergence of conjugate gradient method (Q3622012) (← links)