Primal and dual optimality criteria in convex programming
Tóm tắt
This paper considers the problem of minimizing a convex differentiable function subject to convex differentiable constraints. Necessary and sufficient conditions (not requiring any constraints qualification) for a point to be an optimal solution are given in terms of a parametric linear program. Dual characterization theorems are then derived, which generalizes the classical results ofKuhn-Tucker andJohn.
Tài liệu tham khảo
Bazaraa, M.S.: A Theorem of the Alternative with Application to Convex Programming: Optimality, Duality and Stability. J. Math. Anal. Applic.41 (3), 1973.
Ben-Israel, A., A. Charnes, andK.O. Kortanek: Duality and Asymptotic Solvability over Cones. Bull. Amer. Math. Soc.75, 1969, 318–324.
Ben-Tal, A., A. Ben-Israel, andS. Zlobec: Characterization of Optimality in Convex Programming without a Constraint Qualification. J. Optimiz. Th. and Appl.20, (4), 1976.
Duffin, R.J.: Infinite Programs, in Linear Inequalities and Related Systems. Ed. byH. W. Kuhn andA. W. Tucker. Annals of Math. Studies No. 38. Princeton, N.J., 1956, 157–170.
John, F.: Extremum Problems with Inequalities as Subsidiary Conditions. In Studies and Essays Courant Anniversary Volume. Ed. byK.O. Friedrichs, I.E. Neugebauer andJ.J. Stoker, N.Y., 1948, 187–204.
Kuhn, H. W., andA. W. Tucker: Nonlinear Programming. Proc. Second Berkeley Symp. on Math. Statistics and Probability. Ed. byJ. Neyman, Berkeley 1951.
Rockafellar, R. T.: Some Convex Programs whose Duals are Linearly Constrained. In Nonlinear Programming Ed. byJ.B. Rosen, O.L. Mangasarian andK. Ritter, N.Y. 1970.
—: Ordinary Convex Program without a Duality Gap. J. Optimiz. Th. and Appl.7 (3), 1971, 143–148.