A strongly sub-feasible norm-relaxed SQCQP algorithm for the inequality constrained minimax problems (Q4690572)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6962010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strongly sub-feasible norm-relaxed SQCQP algorithm for the inequality constrained minimax problems |
scientific article; zbMATH DE number 6962010 |
Statements
22 October 2018
0 references
minimax problem
0 references
norm-relaxed
0 references
strongly sub-feasible
0 references
SQCQP algorithm
0 references
global convergence
0 references
0.8804633021354675
0 references
0.8661064505577087
0 references
0.8641248345375061
0 references
0.8342218399047852
0 references
0.8226645588874817
0 references
