The convergence of Broyden algorithms for LC gradient function (Q1582577)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The convergence of Broyden algorithms for LC gradient function
scientific article

    Statements

    The convergence of Broyden algorithms for LC gradient function (English)
    0 references
    21 June 2001
    0 references
    Broyden algorithms are very efficient methods for solving the unrestricted nonlinear programming problem \(\min \{f(x)\mid x\in\mathbb{R}^n\}\). In this paper the convergence of such algorithms is discussed for functions \(f\) which are non-twice-differentiable, but have LC-gradients. Assume \(f\) is uniformly convex and an LC-gradient function then the Broyden algorithms have linear convergence. It is proved that under some additional conditions the convergence is superlinear in the sense \(\|x_k\|\leq C\delta^k\), \(0< \delta< 1\). Unfortunately, the assumptions are rather strong, and there is no example!
    0 references
    Broyden algorithms
    0 references
    uniformly convex function
    0 references
    superlinear convergence
    0 references
    unrestricted nonlinear programming
    0 references
    LC-gradients
    0 references
    linear convergence
    0 references
    0 references

    Identifiers