Displaying similar documents to “Stability in E -convex programming.”

Regions of stability for ill-posed convex programs: An addendum

Sanjo Zlobec (1986)

Aplikace matematiky

Similarity:

The marginal value formula in convex optimization holds in a more restrictive region of stability than that recently claimed in the literature. This is due to the fact that there are regions of stability where the Lagrangian multiplier function is discontinuous even for linear models.

On the separation of parametric convex polyhedral sets with application in MOLP

Milan Hladík (2010)

Applications of Mathematics

Similarity:

We investigate diverse separation properties of two convex polyhedral sets for the case when there are parameters in one row of the constraint matrix. In particular, we deal with the existence, description and stability properties of the separating hyperplanes of such convex polyhedral sets. We present several examples carried out on PC. We are also interested in supporting separation (separating hyperplanes support both the convex polyhedral sets at given faces) and permanent separation...

New Farkas-type constraint qualifications in convex infinite programming

Nguyen Dinh, Miguel A. Goberna, Marco A. López, Ta Quang Son (2007)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly infinite) convex system. Moreover, all the involved functions are assumed to be convex, lower semicontinuous and proper (but not necessarily real-valued)....