论文信息 - A simple constraint qualification in convex programming

A simple constraint qualification in convex programming

We introduce and characterize a class of differentiable convex functions for which the Karush—Kuhn—Tucker condition is necessary for optimality. If some constraints do not belong to this class, then the characterization of optimality generally assumes an asymptotic form.We also show that for the functions that belong to this class in multi-objective optimization, Pareto solutions coincide with strong Pareto solutions,. This extends a result, well known for the linear case.

Sanjo Zlobec | X. Zhou | Faranak Sharifi Mokhtarian

[1] Sanjo Zlobec,et al. Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space , 1970 .

[2] D. W. Peterson. A REVIEW OF CONSTRAINT QUALIFICATIONS IN FINITE-DIMENSIONAL SPACES* , 1973 .

[3] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .

[4] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[5] Henry Wolkowicz,et al. Geometry of optimality conditions and constraint qualifications: The convex case , 1980, Math. Program..

[6] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[7] ASYMPTOTIC CONDITIONS FOR CONSTRAINED MINIMIZATION. , 1968 .

[8] Aharon Ben-Tal,et al. Optimality in Nonlinear Programming: A Feasible Directions Approach. , 1983 .