Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
From MaRDI portal
Publication:4441974
DOI10.1137/S1052623402415846zbMath1046.90103MaRDI QIDQ4441974
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
perturbation; best approximation; convex inequality system; best restricted range uniform approximation; the basic constraint qualification; the strong CHIP
90C46: Optimality conditions and duality in mathematical programming
90C31: Sensitivity, stability, parametric optimization
41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)
Related Items
A Global Approach to Nonlinearly Constrained Best Approximation, On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces, Linear regularity and \(\phi\)-regularity of nonconvex sets, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Limit theory of restricted range approximations of complex-valued continuous functions, The strong conical hull intersection property for convex programming, Subdifferentials of a minimum time function in Banach spaces, Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation, Strong uniqueness of the restricted Chebyshev center with respect to an RS-set in a Banach space, On best restricted range approximation in continuous complex-valued function spaces, Strong CHIP for infinite systems of convex sets in normed linear spaces
