Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542)
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: Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems |
scientific article; zbMATH DE number 6115327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems |
scientific article; zbMATH DE number 6115327 |
Statements
Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (English)
0 references
12 December 2012
0 references
nonlinear semi-infinite programming
0 references
convexification approximation
0 references
cutting plane method
0 references
control design problem
0 references
0 references
0 references
0 references
0.8390964269638062
0 references
0.8345401883125305
0 references
0.8344748020172119
0 references
0.8260918855667114
0 references
