Stabilization and determination of the set of minimal binding constraints in convex programmingFootnote¹

¹Research partly supported by the National Research Council of Canada

References

• Abrams , R.A. and Kerzner , L. 1978 . A simplified test for optimality . J. Optimization Theory Appl , 25 : 161 – 170 .
   Web of Science ®Google Scholar
• Ben-Israel , A. and Ben-Tal , A. 1976 . On a characterization of optimality in convex programming . Mathematical Programming , 11 : 81 – 88 .
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Zlobec , S. Optimality conditions in convex programming in prekopa A. (fid.): Survey of Mathematical Programming . (Proceedings of the IX International Symposium on Mathematical Programming) . Budapest. pp. 153 – 169 . Publishing House of the Hungarian Academy of Sciences .
   Google Scholar
• Ben-Israel , A. , Ben-Tal , A. and Zlobec , S. 1981 . Optimality in Nonlinear Programming - A Feasible Directions Approach , New York : Wiley Interscience .
   Google Scholar
• Ben-Tal , A. , Ben-Israel , A. and Zlobec , S. 1976 . Characterization of optimality in convex programming without a constraint qualification . J. Optimization Theory Appl , 20 : 417 – 437 .
   Google Scholar
• Ben-Tal , A. and Zlobec , S. 1976 . A new class of feasible direction methods , Austin : The University of Texas . Research Report COS 216, Center for Cybernetic Studies
   Google Scholar
• Ben-Tal , A. and Zlobec , S. 1977 . Convex programming and the lexicographic multicriteria problem . Mathematische Operationsforschung und Statistik , 8 : 61 – 73 . series Optimization
   Google Scholar
• Berges , U. 1978 . Verfahren Zulässiger Richtungen für die Konvexe Optimierung , University of Bonn . Diplom- arbeit
   Google Scholar
• Bertsekas , D.P. 1976 . Multiplier methods: a survey . Automatica , 12 : 133 – 145 .
   Web of Science ®Google Scholar
• Borwein , J.M. and Wolkowicz , H. 1979 . Characterizations of optimality without constraint qualification for the abstract convex program , Halifax : Dalhousie University . Research Report 14, Department of Math
   Google Scholar
• Charnes , A. and Cooper , W.W. 1961 . Management Models and Industrial Applications of Linear Programming , Vol. 1 , New York : J. Wiley and Sons .
   Google Scholar
• Craven , B.D. and Zlobec , S. 1980 . Complete characterizations of optimality for convex programming in Banach spaces . Applicable Analysis , 11 : 61 – 78 .
   Google Scholar
• Dubson , M.S. 1978 . A modified Lagrangian function and resolving the duality gap in noncon vex programming . Ekonomika i Matematiceskii Metodi , 14 : 751 – 762 .
   Google Scholar
• Eremin , I. and Astafiev , N.N. 1976 . Introduction to the Theory of Linear and Convex Programming , Moscow : Nauka . (in Russian)
   Google Scholar
• Hestenes , M.R. 1975 . Optimization Theory: The Finite-Dimensional Case , New York : Wiley .
   Google Scholar
• Hettich , R. and Berges , U. 1979 . On improving the directions of search of steepest descent methods . Presented at the IY Symposium on Operations Research . September 1979 , Saarbrucken. Vol. 10-12 ,
   Google Scholar
• Kaplan , A.A. 1978 . On a convex programming method with internal regularization , Vol. 241 , 795 – 799 . Dokladi Akademii Nauk SSSR .
   Google Scholar
• Maguregui , J. 1978 . “ A modified Newton algorithm for functions over convex sets ” . In Nonlinear Programming , Edited by: Manoarartan , O.L. , Meter , R.R. and Robinson , S.M. Vol. 3 , 461 – 473 . Newyork : Acedemic press .
   Google Scholar
• Mangasarian , O. 1969 . Nonlinear Programming , 3
   Google Scholar
• Mangasarian , O. 1975 . Unconstrained Lagrangians in nonlinear programming . SIAM J. Control , 13 : 772 – 791 .
   Web of Science ®Google Scholar
• Rockafellar , R.T. 1974 . Augmented Lagrange multiplier functions and duality in nonconvex programming . SIAM J. Control , 12 : 268 – 275 .
   Web of Science ®Google Scholar
• Rockafellar , R.T. 1974 . “ Conjugate Duality and Optimization ” . In S. I. A. M. Regional Conference , Vol. 16 , Philadelphia . Series in Applied Mathematics
   Google Scholar
• Wolkowicz , H. 1978 . Calculating the cone of directions of constancy . J. Optimization Theory AppL , 25 : 451 – 457 .
   Google Scholar
• Zlobec , S. 1978 . Feasible direction methods in the absence of Slater's condition . Mathe- matische Operationsforschung und Statistik , 9 : 185 – 196 . series Optimization
   Google Scholar
• Zlobec , S. and Ben-Israel , A. 1979 . Duality in convex programming: a linearization approach . Mathematische Operationsforschung und Statistik , 10 : 171 – 178 . series Optimization
   Google Scholar
• Zlobec , S. , Gardner , R. and Ben-Israel , A. 1981 . Regions of stability for arbitrarily perturbed convex programs , Edited by: Fiacco , A.V. New York : M. Dekker . Mathematical Programming with Data Perturbations (to appear
   Google Scholar
• Borwein , J. and Wolkowicz , H. October 1971 . Regularizing the Abstract Convex Program , October , Preprint, Dalhousie University .
   Google Scholar