Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems

DOI10.1007/s11750-011-0226-4zbMath1257.90105arXiv1102.2032OpenAlexW2063159465MaRDI QIDQ1939070

Boris S. Mordukhovich, Marco A. López, Juan Parra, Maria J. Cánovas

Publication date: 26 February 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2032

zbMATH Keywords

parametric optimizationvariational analysiscoderivativesgeneralized differentiationsemi-infinite and infinite programmingquantitative stabilityblock perturbationsconvex infinite inequality systemsLipschitzian bounds

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)

Related Items (5)

DC optimization approach to metric regularity of convex multifunctions with applications to infinite systems ⋮ Subdifferentials and stability analysis of feasible set and Pareto front mappings in linear multiobjective optimization ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth analysis
• Regularity estimates for convex multifunctions
• Convex functions, monotone operators and differentiability
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
• Regularity modulus of arbitrarily perturbed linear inequality systems
• Metric regularity of semi-infinite constraint systems
• On the Stability of the Feasible Set in Optimization Problems
• Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions
• Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
• Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
• Metric regularity and subdifferential calculus
• Stability Theory for Linear Inequality Systems

This page was built for publication: Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems