Lipschitzian stability in linear semi-infinite optimization

DOI10.1007/978-3-031-30014-1_4MaRDI QIDQ6629188

Publication date: 29 October 2024

calmness optimal set mapping linear semi-infinite optimization feasible set mapping Aubin property Hoffman constants

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Set-valued and variational analysis (49J53) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
Calmness modulus of fully perturbed linear programs
Well-posed optimization problems
Calmness of the feasible set mapping for linear inequality systems
On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
Nonsmooth equations in optimization. Regularity, calculus, methods and applications
On error bound moduli for locally Lipschitz and regular functions
New characterizations of Hoffman constants for systems of linear constraints
Calmness of the argmin mapping in linear semi-infinite optimization
On calmness of the argmin mapping in parametric optimization problems
On the continuity of the minimum set of a continuous function
Metric regularity of semi-infinite constraint systems
On the Sensitivity Analysis of Hoffman Constants for Systems of Linear Inequalities
Post-Optimal Analysis in Linear Semi-Infinite Optimization
Stability of Error Bounds for Convex Constraint Systems in Banach Spaces
Lipschitz Behavior of Solutions to Convex Minimization Problems
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
Implicit Functions and Solution Mappings
Variational Analysis in Semi-Infinite and Infinite Programming, I: Stability of Linear Inequality Systems of Feasible Solutions
On the continuity of the value of a linear program and of related polyhedral-valued multifunctions
Some continuity properties of polyhedral multifunctions
Stability Theory for Systems of Inequalities. Part I: Linear Systems
Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
Variational Analysis
Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
Calmness of the Optimal Value in Linear Programming
Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces
Error bounds for solutions of linear equations and inequalities
A Unified Analysis of Hoffman’s Bound via Fenchel Duality
Calmness Modulus of Linear Semi-infinite Programs
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems
Parametric Objective Function (Part 1)
Parametric Objective Function (Part 2)—Generalization
Characterizations of the Strong Basic Constraint Qualifications
A Lipschitzian Characterization of Convex Polyhedra
Convex Analysis
On sharp Lipschitz and Hoffman constants for a system of linear inequalities
Lipschitz upper semicontinuity in linear optimization via local directional convexity

This page was built for publication: Lipschitzian stability in linear semi-infinite optimization