Abstract
This paper derives a new constraint qualification for nondifferential convex programming problem, by using the distance between the feasible set and the perturbed feasible sets. If the feasible set is bounded, then this constraint qualification is weaker than Stater’s constraint qualification.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Wolkowicz. Geometry of Optimality Condition and Constraint Qualifications, the Convex Case.Mathematical Programming, 1980, 9: 32–60
Li Shizheng. Necessary and Sufficient Conditions for Regularity of Constraints in Convex Programming.Optimization, 1992, 25: 329–340
O.L. Mangasarian. Nonlinear Programming. Mcgraw-Hill Book Company, New York, 1969
D.W. Peterson. A Review of Constraint Qualifications in Finite-dimensional Spaces.SIAM Review, 1973, 15: 639–654
F.J. Gould, J.W. Tolle. Geometry of Optimality Conditions and Constraint Qualifications.Mathematical Programming, 1972, 2: 1–18
J.P. Penot. A New Constraint Qualification Condition.Jounal of Optimization Theory and Applications, 1986, 48: 459–468
Author information
Authors and Affiliations
Additional information
This research is supported by the National Natural Science Foundation of China (No.19671053).
Rights and permissions
About this article
Cite this article
Shizheng, L. A constraint qualification for convex programming. Acta Mathematicae Applicatae Sinica 16, 362–365 (2000). https://doi.org/10.1007/BF02671125
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02671125