Constraint qualifications for semi-infinite systems of convex inequalities

SIAM Journal on Optimization

Volumn 11, Issue 1, 2000, Pages 31-52

  Li, Wu ^a   Nahak, Chandal ^a,b   Singer, Ivan ^c  

^a OLD DOMINION UNIVERSITY   (United States)

^b BERHAMPUR UNIVERSITY   (India)

^c INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Constraint qualifications; Convex Farkas Minkowski systems; Distance formulas; Semi infinite inequality systems

Indexed keywords

EID: 0034550220     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499355247     Document Type: Article

References (19)

1. J. ABADIE, On the Kuhn-Tucker theorem, in Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam, 1967, pp. 19-36.
2. C. BERGTHALLER AND I. SINGER, The distance to a polyhedron, Linear Algebra. Appl., 169 (1992), pp. 111-129.
3. M. D. FAJARDO AND M. A. LÓPEZ, Locally Farkas-Minkowski systems in convex semi-infinite programming, J. Optirn. Theory Appl., pp. 313-335.
4. K. FAN, On systems of linear inequalities, in Linear Inequalities and Related Topics, H. W. Kuhn and A. W. Tucker, eds., Princeton University Press, Princeton, NJ, 1956, pp. 99-156.
5. M. A. GOBERNA AND M. A. LÓPEZ, Linear Semi-infinite Optimization, Wiley, Chichester, 1998.
6. M. A. GOBERNA, M. A. LÓPEZ, AND J. PASTOR, Farkas-Minkowski systems in semi-infinite programming, Appl. Math. Optim., 7 (1981), pp. 295-308.
7. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms I, Springer-Verlag, Berlin, Heidelberg, 1993.
8. V. L. LEVIN, Application of a theorem of E. Helly in convex programming, problems of best approximation and related topics, Mat. Sb., 79 (1969), pp. 250-263, (in Russian).
9. A. S. LEWIS AND J.-S. PANG, Error bounds for convex inequality systems, in Generalized Convexity, Generalized Monotonicity: Recent Results, J.-P. Crouzeix, J.-E. Martínez-Legaz, and M. Volle, eds., Kluwer Academic Publishers, Dordrecht, Boston, 1998, pp. 75-110.
10. W. LI, Abadie's constraint qualification, metric regularity, and error bounds for differentiable convex inequalities, SIAM J. Optim., 7 (1997), pp. 966-978.
11. W. LI AND I. SINGER, Asymptotic Constraint Qualifications and Error Bounds for Semi-Infinite Systems of Convex Inequalities, preprint, Dept. of Math. and Statistics, Old Dominion University, Norfolk, VA.
12. M. A. LÓPEZ AND E. VERCHER, Optimality conditions for nondifferentiable convex semi-infinite programming, Math. Programming, 27 (1983), pp. 307-319.
13. B. N. PSHENICHNYI, Convex programming in a normed space, Kibernetika, 5 (1965), pp. 46-54, (in Russian).
14. R. PUENTE AND V. N. VERA DE SERIO, Locally Farkas-Minkowski linear inequality systems, Top, 7 (1999), pp. 103-121.
15. A. SCHRIJVER, Theory of Linear and Integer Programming, Wiley, Chichester, UK, 1986.
16. I. SINGER, The Theory of Best Approximation and Functional Analysis, CBMS-NSF Regional Conf. Ser. in Appl. Math., 13, SIAM, Philadelphia, PA, 1974.
17. I. SINGER, Duality for optimization and best approximation over finite intersections, Numer. Funct. Anal. Optim., 19 (1998), pp. 903-915.
18. M. VALADIER, Sous-différentiels d'une borne supérieure et d'une somme continue de fonctions convexes, CRAS Paris, 266 (1968), pp. 14-16.
19. Y.-J. ZHU, Generalizations of some fundamental theorems in linear inequalities, Acta Math. Sinica, 16 (1966), pp. 25-39.