An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions (Q4884046): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4238030832 / rank
 
Normal rank

Latest revision as of 22:18, 19 March 2024

scientific article; zbMATH DE number 898156
Language Label Description Also known as
English
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
scientific article; zbMATH DE number 898156

    Statements

    An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions (English)
    0 references
    0 references
    19 March 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    semi-infinite programming
    0 references
    many constraints
    0 references
    discretization
    0 references
    local convergence
    0 references
    sequential quadratic programming
    0 references
    continuous minimax problems
    0 references
    SQP method
    0 references
    line search
    0 references
    global convergence
    0 references
    algorithms
    0 references
    0 references