Extensions of Radstrom's lemma with application to stability theory of mathematical programming

DOI10.1016/0022-247X(86)90234-9zbMath0596.52009WikidataQ124798464 ScholiaQ124798464MaRDI QIDQ1078809

Robert G. Batson

Publication date: 1986

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

stabilityprogrammingHausdorff distanceconvex sets in Euclidean spaceparametric mathematicalpoint-to-set mapRadstrom's lemma

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Set-valued functions (26E25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (3)

A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ Combinatorial behavior of extreme points of perturbed polyhedra ⋮ Necessary and sufficient conditions for boundedness of extreme points of unbounded convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some characterizations of convex polyhedra
• Introduction to sensitivity and stability analysis in nonlinear programming
• Regularity and Stability for Convex Multivalued Functions
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Rates of Stability in Nonlinear Programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Stability in Nonlinear Programming
• Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
• Point-to-Set Maps in Mathematical Programming
• An Embedding Theorem for Spaces of Convex Sets

This page was built for publication: Extensions of Radstrom's lemma with application to stability theory of mathematical programming