The complexity of a special convex programming problem connected with nonlinear optimization (Q3835664)
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 746405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of a special convex programming problem connected with nonlinear optimization |
scientific article; zbMATH DE number 746405 |
Statements
The complexity of a special convex programming problem connected with nonlinear optimization (English)
0 references
17 August 1995
0 references
computational cost
0 references
infinite feasible sets
0 references
