Critical objective size and calmness modulus in linear programming
From MaRDI portal
Recommendations
- Calmness modulus of fully perturbed linear programs
- Calmness of the optimal value in linear programming
- Calmness modulus of linear semi-infinite programs
- Point-based neighborhoods for sharp calmness constants in linear programming
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
Cites work
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- A Characterization of Stability in Linear Programming
- Boundary of subdifferentials and calmness moduli in linear semi-infinite optimization
- Calmness modulus of fully perturbed linear programs
- Calmness modulus of linear semi-infinite programs
- Calmness of constraint systems with applications
- Calmness of the feasible set mapping for linear inequality systems
- Characterizations of error bounds for lower semicontinuous functions on metric spaces
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- Error bounds for solutions of linear equations and inequalities
- First order and second order characterizations of metric subregularity and calmness of constraint set mappings
- Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
- Implicit Functions and Solution Mappings
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- On the Calmness of a Class of Multifunctions
- Optimization methods and stability of inclusions in Banach spaces
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Some continuity properties of polyhedral multifunctions
- Stability of error bounds for convex constraint systems in Banach spaces
- Variational Analysis
Cited in
(7)- Point-based neighborhoods for sharp calmness constants in linear programming
- Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
- Calmness modulus of fully perturbed linear programs
- A data-independent distance to infeasibility for linear conic systems
- Calmness of the optimal value in linear programming
- Recent contributions to linear semi-infinite optimization
- Recent contributions to linear semi-infinite optimization: an update
This page was built for publication: Critical objective size and calmness modulus in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505622)