Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
DOI10.1080/02331934.2016.1227980zbMATH Open1370.90183arXiv1308.2520OpenAlexW3098289439MaRDI QIDQ2836093FDOQ2836093
Authors: Zhou Wei, Qinghai He
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.2520
Recommendations
- The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces
- Linear regularity for an infinite system formed by \(p\)-uniformly subsmooth sets in Banach spaces
- Bounded linear regularity of convex sets in Banach spaces and its applications
- Strong CHIP, normality, and linear regularity of convex sets
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Programming in abstract spaces (90C48)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Title not available (Why is that?)
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Error bounds in mathematical programming
- The method of projections for finding the common point of convex sets
- Hilbertian convex feasibility problem: Convergence of projection methods
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Error Bounds for Abstract Linear Inequality Systems
- The strong conical hull intersection property for convex programming
- Strong Abadie CQ, ACQ, calmness and linear regularity
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- 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
- Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets
- Linear Regularity for a Collection of Subsmooth Sets in Banach Spaces
- Strong CHIP, normality, and linear regularity of convex sets
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Constrained best approximation in Hilbert space
- The Duality of Pairs of Wedges
- Strong CHIP for infinite systems of convex sets in normed linear spaces
Cited In (10)
- On applications of the calmness moduli for multifunctions to error bounds
- Bounded linear regularity, strong CHIP, and CHIP are distinct properties
- The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces
- Subtransversality and strong CHIP of closed sets in Asplund spaces
- Strong CHIP, normality, and linear regularity of convex sets
- Linear regularity for an infinite system formed by \(p\)-uniformly subsmooth sets in Banach spaces
- Bounded linear regularity of convex sets in Banach spaces and its applications
- Porosity and the bounded linear regularity property
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Strong CHIP for infinite systems of convex sets in normed linear spaces
This page was built for publication: Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836093)