Characterizations of the Strong Basic Constraint Qualifications

Authors:
Hui Hu
Affiliations:
Department of Mathematical Sciences, Northern Illinois University, DeKalb, Illinois 60115
Venue:
Mathematics of Operations Research
Year:
2005

Citing 5
Cited 1

Error bounds in mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification

SIAM Journal on Optimization
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities

SIAM Journal on Optimization
Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities

SIAM Journal on Optimization
Metric Regularity and Constraint Qualifications for Convex Inequalities on Banach Spaces

SIAM Journal on Optimization

Metric Subregularity and Calmness for Nonconvex Generalized Equations in Banach Spaces

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we characterize the general difference between strong basic constraint qualification (BCQ) and BCQ. For this purpose, we introduce a new measurement, the extent of a subdifferential, and show that for an inequality defined by a proper convex function f, the strong BCQ at a boundary point x of the solution set is equivalent to the extended BCQ plus the positivity of the extent of subdifferential at x. Applying the above characterization to the case when f is the maximum of finitely many differentiable convex functions, we show that the metric regularity at a boundary point x is equivalent to BCQ at every point in a "boundary-neighborhood" of x. In addition, we provide an answer to the open question proposed by Zheng and Ng [11]. We construct an example to show that BCQ at a boundary point x does not ensure the metric regularity at x.