On the stable containment of two sets

DOI10.1007/s10898-007-9276-4zbMath1145.49018MaRDI QIDQ934810

Virginia N. Vera de Serio, Miguel Angel Goberna

Publication date: 30 July 2008

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

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

zbMATH Keywords

set-valued mappings; stability theory; containment problem; semi-infinite systems

Mathematics Subject Classification ID

90C25: Convex programming

49K40: Sensitivity, stability, well-posedness

90C34: Semi-infinite programming

Related Items

Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, A collision detection approach for maximizing the material utilization, Characterizing robust set containments and solutions of uncertain linear programs without qualifications, Stability in linear optimization and related topics. A personal tour, Dual characterizations of set containments involving uncertain polyhedral sets in Banach spaces with applications

Cites Work

• Unnamed Item
• Unnamed Item
• On the stability of the boundary of the feasible set in linear optimization
• Set containment characterization
• Upper semicontinuity of the feasible set mapping for linear inequality systems
• On the stability of closed-convex-valued mappings and the associated boundaries
• Dual characterizations of set containments with strict convex inequalities
• A semi-infinite approach to design centering
• Variational Analysis
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Learning Theory and Kernel Machines
• Set-valued analysis