A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions (Q3661324)

From MaRDI portal
Revision as of 16:24, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
scientific article

    Statements

    A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions (English)
    0 references
    0 references
    1983
    0 references
    globally and superlinearly convergent algorithm
    0 references
    one-dimensional constrained minimization
    0 references
    linear approximation of constrained function
    0 references
    penalized polyhedral step
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references