Error Bounds for Abstract Linear Inequality Systems
From MaRDI portal
Recommendations
Cited in
(19)- Analysis of error propagation in the ABS class for linear systems
- Error bounds for inconsistent linear inequalities and programs
- Second order sufficient optimality conditions in vector optimization
- Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
- Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces
- On error bounds for systems
- Global error bound for convex inclusion problems
- Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
- Approximate solutions for abstract inequality systems
- Weak sharp efficiency in multiobjective optimization
- scientific article; zbMATH DE number 51251 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- Error bounds for solutions of linear equations and inequalities
- scientific article; zbMATH DE number 6135089 (Why is no real title available?)
- Error Bounds for Some Convex Functions and Distance Composite Functions
- Error bounds, facial residual functions and applications to the exponential cone
- Subtransversality and strong CHIP of closed sets in Asplund spaces
- Global weak sharp minima for convex (semi-)infinite optimization problems
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
This page was built for publication: Error Bounds for Abstract Linear Inequality Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785867)