Dual characterizations of set containments with strict convex inequalities

DOI10.1007/s10898-005-3885-6zbMath1098.90085OpenAlexW2117535703MaRDI QIDQ2494477

Yanyan Li

Publication date: 28 June 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/8135

zbMATH Keywords

ConjugacyConvex functionsExistence theoremsSet containmentDual conesSemi-infinite systems

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (21)

Motzkin decomposition of closed convex sets ⋮ On finite linear systems containing strict inequalities ⋮ Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications ⋮ Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Stability in linear optimization and related topics. A personal tour ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ Duality for sets of strong Slater points ⋮ On stable uniqueness in linear semi-infinite optimization ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ On the stable containment of two sets ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Characterizing robust set containments and solutions of uncertain linear programs without qualifications ⋮ Set containment characterization with strict and weak quasiconvex inequalities ⋮ Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations ⋮ On the stability of linear systems with an exact constraint set ⋮ Stability of the feasible set mapping of linear systems with an exact constraint set ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Set containment characterization for quasiconvex programming

Cites Work

• On the stability of the boundary of the feasible set in linear optimization
• Set containment characterization
• Analyzing linear systems containing strict inequalities via evenly convex hulls
• Knowledge-based semidefinite linear programming classifiers
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints

This page was built for publication: Dual characterizations of set containments with strict convex inequalities