Characterizations of optimality in convex programming: the nondifferentiable case
Authors:
- A. Ben-TalABA. Ben-Tal
- A. Ben-IsraelABA. Ben-Israel
- M.Z. NashedMNM.Z. Nashed
- 1 August 1979
- journal article
- research article
- Published by Taylor & Francis in Applicable Analysis
- Vol. 9 (2) , 137-156
Abstract
Primal, dual and saddle-point characterizations of optimality are given for convex programming in the general case (nondifferentiable functions and no constraint qualification).Keywords
This publication has 6 references indexed in Scilit:
- Necessary and Sufficient Conditions for a Pareto Optimum in Convex ProgrammingEconometrica, 1977
- Characterization of optimality in convex programming without a constraint qualificationJournal of Optimization Theory and Applications, 1976
- Geometric Functional Analysis and its Applications1975
- Lectures on Mathematical Theory of Extremum Problems1972
- Duality in Nonlinear Programming: A Simplified Applications-Oriented DevelopmentSIAM Review, 1971
- Convex Analysis1970