Pages that link to "Item:Q618548"

The following pages link to A non-monotone line search algorithm for unconstrained optimization (Q618548):

Displaying 11 items.

• A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
• An extended nonmonotone line search technique for large-scale unconstrained optimization (Q1675990) (← links)
• Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions (Q2256241) (← links)
• On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
• A nonmonotone smoothing Newton method for system of nonlinear inequalities based on a new smoothing function (Q2322485) (← links)
• A secant-based Nesterov method for convex functions (Q2361131) (← links)
• A regularized smoothing Newton-type algorithm for quasi-variational inequalities (Q2363836) (← links)
• An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions (Q2451766) (← links)
• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
• A nonmonotone ODE-based method for unconstrained optimization (Q2935398) (← links)
• A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities (Q3177631) (← links)