Dual characterizations of set containments with strict convex inequalities

DOI10.1007/S10898-005-3885-6zbMATH Open1098.90085OpenAlexW2117535703MaRDI QIDQ2494477FDOQ2494477

Authors: 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

Recommendations

• Dual characterizations of the set containments with strict cone-convex inequalities in Banach spaces
• Set containment characterization with strict and weak quasiconvex inequalities
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications
• Set containment characterization for quasiconvex programming
• Duality theorems for convex and quasiconvex set functions
• On the duality of Coppel-Conti sets
• scientific article; zbMATH DE number 4056244
• Dual characterizations of relative continuity of convex functions
• Duality on convex sets in generalized regions

zbMATH Keywords

ConjugacyConvex functionsExistence theoremsSet containmentDual conesSemi-infinite systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (25)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494477)