On the continuity of the optimal set mapping of a convex programming problem (Q2563367)
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 957026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the continuity of the optimal set mapping of a convex programming problem |
scientific article; zbMATH DE number 957026 |
Statements
On the continuity of the optimal set mapping of a convex programming problem (English)
0 references
11 December 1996
0 references
The authors prove the Hausdorff continuity of the optimal mapping (as a function of the right hand sides) of the convex programming problem, in which the constraints are given by convex polynomials of degree \(\leq 4\), and the objective function is convex and weak analytic (including all the polynomials of arbitrary degree).
0 references
convex programming
0 references
convex polynomials
0 references
Hausdorff continuity
0 references
0.8407852053642273
0 references
0.825211763381958
0 references
0.8121026754379272
0 references
0.8080001473426819
0 references
