On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
From MaRDI portal
Publication:1005132
DOI10.1007/s11228-007-0052-xzbMath1156.90448OpenAlexW2011232570MaRDI QIDQ1005132
F. J. Gómez-Senent, Juan Parra, Maria J. Cánovas
Publication date: 16 March 2009
Published in: Set-Valued Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-007-0052-x
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Set-valued and variational analysis (49J53) Semi-infinite programming (90C34)
Related Items (7)
Subdifferentials and stability analysis of feasible set and Pareto front mappings in linear multiobjective optimization ⋮ Regularity modulus of arbitrarily perturbed linear inequality systems ⋮ Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization ⋮ Lipschitz modulus in convex semi-infinite optimizationviad.c. functions ⋮ Lipschitz modulus of the optimal value in linear programming ⋮ Pseudo-Lipschitz property of linear semi-infinite vector optimization problems ⋮ Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Metric regularity of the feasible set mapping in semi-infinite optimization
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Characterizing the single-valuedness of multifunctions
- Linear programming, complexity theory and elementary functional analysis
- On existence and uniqueness of stationary points in semi-infinite optimization
- Metric regularity of semi-infinite constraint systems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
- Metric regularity and subdifferential calculus
- Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability Theory for Linear Inequality Systems
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- The radius of metric regularity
- Strong Lipschitz Stability of Stationary Solutions for Nonlinear Programs and Variational Inequalities
- Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization
- Unifying Condition Numbers for Linear Programming
This page was built for publication: On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
