Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces

DOI10.1137/040613238MaRDI QIDQ5470195zbMATH OpenOpenAlexFDO

Authors C. Li, K. F. Ng

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

zbMATH Keywords

interior-point conditionstrong conical hull intersection propertysystem of closed convex sets

Mathematics Subject Classification ID

Approximation with constraints (41A29) Convex sets without dimension restrictions (aspects of convex geometry) (52A05) Convex programming (90C25) Semi-infinite programming (90C34)

Recommendations

• Strong CHIP for infinite systems of convex sets in normed linear spaces
• Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Strong CHIP, normality, and linear regularity of convex sets
• The strong conical hull intersection property for convex programming

Cited in

(18)

• Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
• About intrinsic transversality of pairs of sets
• Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective 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
• Unified approach to some geometric results in variational analysis
• On best restricted range approximation in continuous complex-valued function spaces
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Boundary Half-Strips and the Strong CHIP
• Strong CHIP for infinite systems of convex sets in normed linear spaces
• Total Lagrange duality for DC infinite optimization problems
• The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
• Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
• Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces
• On constraint qualifications for an infinite system of quasiconvex inequalities
• Subtransversality and strong CHIP of closed sets in Asplund spaces
• On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming

This page was built for publication: Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470195)