Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces

DOI10.1137/S1052623495284832zbMath0872.90070OpenAlexW2067951301MaRDI QIDQ3124046

Sien Deng

Publication date: 11 March 1997

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623495284832

zbMATH Keywords

reflexive Banach spaceSlater constraint qualificationsystem of convex inequalitiesHoffman's error bound

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Programming in abstract spaces (90C48)

Related Items (12)

A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces ⋮ Error bounds for mixed integer nonlinear optimization problems ⋮ Error bounds in mathematical programming ⋮ Bounds on the objective value of feasible roundings ⋮ Robust error bounds for uncertain convex inequality systems with applications ⋮ Global error bounds for piecewise convex polynomials ⋮ Minimum recession-compatible subsets of closed convex sets ⋮ Condition numbers and error bounds in convex programming ⋮ New uniform parametric error bounds ⋮ Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems ⋮ Error bounds for eigenvalue and semidefinite matrix inequality systems ⋮ Error bounds for mixed integer linear optimization problems

This page was built for publication: Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces