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.90054OpenAlexW2072822417WikidataQ57511279 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
Convex programming (90C25) Semi-infinite programming (90C34) Approximation with constraints (41A29) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Related Items (38)
Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications ⋮ Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1] ⋮ Dual sufficient characterizations of transversality properties ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization ⋮ Set regularities and feasibility problems ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Geometric and metric characterizations of transversality properties ⋮ Stationarity and regularity of infinite collections of sets ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Robust least square semidefinite programming with applications ⋮ Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function ⋮ New extremal principles with applications to stochastic and semi-infinite programming ⋮ About \([q\)-regularity properties of collections of sets] ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ About intrinsic transversality of pairs of sets ⋮ About subtransversality of collections of sets ⋮ Variational geometric approach to generalized differential and conjugate calculi in convex analysis ⋮ Penalty Methods for a Class of Non-Lipschitz Optimization Problems ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC 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 ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Unnamed Item ⋮ Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus ⋮ Duality for Optimization Problems with Infinite Sums ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets ⋮ Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces ⋮ 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
This page was built for publication: The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
