A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781)

From MaRDI portal
Revision as of 16:03, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6305398
Language Label Description Also known as
English
A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
scientific article; zbMATH DE number 6305398

    Statements

    A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (English)
    0 references
    19 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linesearch method
    0 references
    minimax problem
    0 references
    nonmonotone technique
    0 references
    nonsmooth optimization
    0 references
    SQP algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references