Direct theorems in semi-infinite convex programming
Copyright policy )Direct theorems in semi-infinite convex programming
We show that a semi-infinite quasi-convex program with certain regularity conditions possesses finitely constrained subprograms with the same optimal value. This result is applied to various problems.
- Dalhousie University Canada
Programming in abstract spaces, semi-infinite quasi-convex program, quasi-differentiable programming, Convex programming, multicriteria programming, abstract programming, direct theorem, existence of finite subprograms, Sensitivity, stability, parametric optimization, duality, Helly-type theorem, finitely many variables, Duality theory (optimization), infinitely constrained programming problems
Programming in abstract spaces, semi-infinite quasi-convex program, quasi-differentiable programming, Convex programming, multicriteria programming, abstract programming, direct theorem, existence of finite subprograms, Sensitivity, stability, parametric optimization, duality, Helly-type theorem, finitely many variables, Duality theory (optimization), infinitely constrained programming problems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).34 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!