Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (Q4742570)

From MaRDI portal
Revision as of 17:38, 9 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3797508
Language Label Description Also known as
English
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
scientific article; zbMATH DE number 3797508

    Statements

    Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (English)
    0 references
    0 references
    0 references
    1982
    0 references
    polyhedral approximation
    0 references
    nonsmooth optimization
    0 references
    univariate optimization
    0 references
    quadratic approximation
    0 references
    superlinear convergence
    0 references
    local piece-wise linear approximation
    0 references
    unconstrained minimization problem
    0 references
    polyhedral method
    0 references
    subgradient
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references