Name
Abstract | ||
|---|---|---|
When every feasible stable perturbation of data results in a non-improvement of the optimal value function, then we talk about
an ‘optimal input’ or an ‘optimal selection of data”. In this paper we describe such data for convex programs using perturbed
saddle points. |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1007/BF02591721 | Math. Program. |
Keywords | Field | DocType |
optimal input,perturbations,regions of stability,convex programs,saddle points.,convex programming,saddle point | Mathematical optimization,Convex combination,Convex hull,Convex set,Subderivative,Proper convex function,Convex optimization,Convex analysis,Linear matrix inequality,Mathematics | Journal |
Volume | Issue | ISSN |
25 | 1 | 1436-4646 |
Citations | PageRank | References |
7 | 1.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanjo Zlobec | 1 | 54 | 14.44 |