Error Bounds for Abstract Linear Inequality Systems
From MaRDI portal
Publication:4785867
DOI10.1137/S1052623401388914zbMath1029.90071MaRDI QIDQ4785867
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items
Weak sharp efficiency in multiobjective optimization ⋮ Second order sufficient optimality conditions in vector optimization ⋮ Strong Fermat rules for constrained set-valued optimization problems on Banach spaces ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Global error bound for convex inclusion problems ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces ⋮ Error bounds for approximate solutions of abstract inequality systems and infinite systems of inequalities on Banach spaces ⋮ On error bounds for systems
