Pages that link to "Item:Q2553146"

The following pages link to Quadratically convergent algorithms and one-dimensional search schemes (Q2553146):

Displaying 18 items.

• A gradient-related algorithm with inexact line searches (Q596214) (← links)
• A new class of supermemory gradient methods (Q865511) (← links)
• An efficient interfacing of golden-section and quadratic searches (Q1078081) (← links)
• A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms (Q1138482) (← links)
• A class of quadratically convergent algorithms for constrained function minimization (Q1211414) (← links)
• Variable metric methods in Hilbert space with applications to control problems (Q1218146) (← links)
• The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
• A new descent algorithm with curve search rule (Q1764727) (← links)
• Convergence of supermemory gradient method (Q2454990) (← links)
• Efficient unidimensional direct search schemes for optimization problems. (Q2468611) (← links)
• Memory gradient method with Goldstein line search (Q2469911) (← links)
• On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
• Method of dual matrices for function minimization (Q2560773) (← links)
• Numerical experiments on dual matrix algorithms for function minimization (Q2560774) (← links)
• Convergence of descent method without line search (Q2570691) (← links)
• A new super-memory gradient method with curve search rule (Q2571993) (← links)
• A method to accelerate the rate of convergence of a class of optimization algorithms (Q4123091) (← links)
• A new class of memory gradient methods with inexact line searches (Q4675852) (← links)