The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
From MaRDI portal
Publication:3503212
DOI10.1137/060652087zbMath1151.90054WikidataQ57511279 ScholiaQ57511279MaRDI QIDQ3503212
Ting Kei Pong, Chong Li, Ng Kung-fu
Publication date: 22 May 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060652087
90C25: Convex programming
90C34: Semi-infinite programming
41A29: Approximation with constraints
52A05: Convex sets without dimension restrictions (aspects of convex geometry)
Related Items
On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery, Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces, Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function, Unnamed Item, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, Duality for Optimization Problems with Infinite Sums, Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, Total Lagrange duality for DC infinite optimization problems, Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces, Robust least square semidefinite programming with applications, About \([q\)-regularity properties of collections of sets], About subtransversality of collections of sets, Variational geometric approach to generalized differential and conjugate calculi in convex analysis, Dual sufficient characterizations of transversality properties, Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems, Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications, Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems, Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications, 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, Stationarity and regularity of infinite collections of sets, Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus, Some new characterizations of intrinsic transversality in Hilbert spaces, Geometric and metric characterizations of transversality properties, New extremal principles with applications to stochastic and semi-infinite programming, Quantitative characterizations of regularity properties of collections of sets, Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems, Set regularities and feasibility problems, The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions, The stable Farkas lemma for composite convex functions in infinite dimensional spaces, Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
