A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem |
scientific article; zbMATH DE number 6305398
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
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
0 references
0.94351006
0 references
0.92145324
0 references
0 references
0.91913426
0 references
0.91876996
0 references
0.91834724
0 references
0.91834724
0 references
0.90547574
0 references
