Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-011-9452-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-011-9452-9 / rank | |||
Normal rank | |||
Latest revision as of 00:59, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems |
scientific article |
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
