Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions

Related Items (18)

A descent hybrid conjugate gradient method based on the memoryless BFGS update ⋮ Scaling damped limited-memory updates for unconstrained optimization ⋮ The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems ⋮ Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems ⋮ Spectral scaling BFGS method ⋮ A double parameter scaled BFGS method for unconstrained optimization ⋮ Non-asymptotic superlinear convergence of standard quasi-Newton methods ⋮ A double parameter self-scaling memoryless BFGS method for unconstrained optimization ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ Computational experiments with scaled initial hessian approximation for the broyden family methods^∗ ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Global convergence property of scaled two-step BFGS method ⋮ An adaptive scaled BFGS method for unconstrained optimization ⋮ On the behaviour of a combined extra-updating/self-scaling BFGS method ⋮ A variation of Broyden class methods using Householder adaptive transforms ⋮ Wide interval for efficient self-scaling quasi-Newton algorithms ⋮ Numerical expirience with a class of self-scaling quasi-Newton algorithms ⋮ An adaptive sizing BFGS method for unconstrained optimization

This page was built for publication: Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions