A strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems (Q2859785)
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 strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems |
scientific article; zbMATH DE number 6230220
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems |
scientific article; zbMATH DE number 6230220 |
Statements
19 November 2013
0 references
discretized semi-infinite optimization problem
0 references
strongly sub-feasible direction method
0 references
norm-relaxed SQP algorithm
0 references
global convergence
0 references
A strongly sub-feasible norm-relaxed SQP algorithm for finely discretized semi-infinite optimization problems (English)
0 references
