A note on d-stability of convex programs and limiting Lagrangians (Q1184349): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01585706 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112800266 / rank | |||
Normal rank | |||
Latest revision as of 08:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on d-stability of convex programs and limiting Lagrangians |
scientific article |
Statements
A note on d-stability of convex programs and limiting Lagrangians (English)
0 references
28 June 1992
0 references
It is shown that the results concerning the non-existence of a duality gap in semi-infinite programming stated by \textit{D. F. Karney} [see Math. Program. 27, 75-82 (1983; Zbl 0527.49027)] can be also derived from a general criterion for \(d\)-stability of convex programs. The author shows further how to perturb the objective function of a convex program in \(R^ n\) by a sublinear functional in order to obtain a new function that satisfies the sufficient condition. Characterizations for the existence of optimal solutions of the initial problem are given.
0 references
permutations
0 references
recession cone
0 references
recession function
0 references
duality gap
0 references
\(d\)- stability of convex programs
0 references
0 references
0 references
