Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces

DOI10.1137/S1052623402415846zbMath1046.90103OpenAlexW1993798057MaRDI QIDQ4441974

Chong Li, Ng Kung-fu

Publication date: 19 January 2004

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623402415846

zbMATH Keywords

perturbationbest approximationconvex inequality systembest restricted range uniform approximationthe basic constraint qualificationthe strong CHIP

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces ⋮ Linear regularity and \(\phi\)-regularity of nonconvex sets ⋮ Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints ⋮ Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization ⋮ Characterizing nonconvex constrained best approximation using Robinson's constraint qualification ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Stationarity and regularity of infinite collections of sets ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Characterizing best approximation from a convex set without convex representation ⋮ BCQ and strong BCQ for nonconvex generalized equations with applications to metric subregularity ⋮ Strong CHIP for infinite systems of convex sets in normed linear spaces ⋮ Limit theory of restricted range approximations of complex-valued continuous functions ⋮ The strong conical hull intersection property for convex programming ⋮ Subdifferentials of a minimum time function in Banach spaces ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation ⋮ Strong uniqueness of the restricted Chebyshev center with respect to an RS-set in a Banach space ⋮ On best restricted range approximation in continuous complex-valued function spaces

This page was built for publication: Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces