Characterizations of the strong basic constraint qualifications

Characterizations of the strong basic constraint qualifications

0.00 Avg rating0 Votes
Article ID: iaor20061415
Country: United States
Volume: 30
Issue: 4
Start Page Number: 956
End Page Number: 965
Publication Date: Nov 2005
Journal: Mathematics of Operations Research
Authors:
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. We construct an example to show that BCQ at a boundary point x does not ensure the metric regularity at x.

Reviews

Required fields are marked *. Your email address will not be published.