Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
From MaRDI portal
Publication:5470195
DOI10.1137/040613238zbMath1122.90081OpenAlexW2075979998MaRDI QIDQ5470195
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ecfb6348573b5456e03986a1537149f32b4fb5b7
Convex programming (90C25) Semi-infinite programming (90C34) Approximation with constraints (41A29) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items (14)
Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Unified approach to some geometric results in variational analysis ⋮ On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces ⋮ Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ Strong CHIP for infinite systems of convex sets in normed linear spaces ⋮ About intrinsic transversality of pairs of sets ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ On best restricted range approximation in continuous complex-valued function spaces
This page was built for publication: Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
