Pages that link to "Item:Q1881700"

The following pages link to Convergence of line search methods for unconstrained optimization (Q1881700):

Displaying 38 items.

• Two modifications of the method of the multiplicative parameters in descent gradient methods (Q440766) (← links)
• Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
• Nonmonotone adaptive trust region method (Q621656) (← links)
• An efficient descent direction method with cutting planes (Q623787) (← links)
• A conjugate gradient method with descent direction for unconstrained optimization (Q732160) (← links)
• Convergence of descent method with new line search (Q815995) (← links)
• Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
• New inexact line search method for unconstrained optimization (Q850832) (← links)
• An accelerated double step size model in unconstrained optimization (Q902839) (← links)
• Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
• Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
• A modified PRP conjugate gradient method (Q1026553) (← links)
• A new trust region method with adaptive radius (Q1029622) (← links)
• A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
• Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)
• Hybridization of accelerated gradient descent method (Q1989937) (← links)
• A reduced-space line-search method for unconstrained optimization via random descent directions (Q2007776) (← links)
• A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems (Q2010240) (← links)
• A note on hybridization process applied on transformed double step size model (Q2200788) (← links)
• A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
• Optimization on the hierarchical Tucker manifold - applications to tensor completion (Q2350002) (← links)
• The convergence of subspace trust region methods (Q2389569) (← links)
• A new trust region method for unconstrained optimization (Q2479356) (← links)
• On step-size estimation of line search methods (Q2489176) (← links)
• Convergence of nonmonotone line search method (Q2493941) (← links)
• An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
• New line search methods for unconstrained optimization (Q2510603) (← links)
• Convergence of descent method without line search (Q2570691) (← links)
• A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems (Q3016307) (← links)
• A New Method with Descent Property for Symmetric Nonlinear Equations (Q3058366) (← links)
• Computer Algebra and Line Search (Q3086910) (← links)
• A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations (Q4641557) (← links)
• A new class of memory gradient methods with inexact line searches (Q4675852) (← links)
• The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations (Q5031714) (← links)
• Accelerated multiple step-size methods for solving unconstrained optimization problems (Q5865330) (← links)
• Accelerated gradient descent methods with line search (Q5961879) (← links)
• An accelerated structured quasi-Newton method with a diagonal second-order Hessian approximation for nonlinear least squares problems (Q6489234) (← links)