
doi: 10.1007/bf01584095
In recent times the Kuhn—Tucker optimality conditions and the duality theorems for convex programming have been extended by generalizations of the convexity concept. In this paper the notion of a symmetric derivative for a function of several variables is introduced and used to provide extensions of some fundamental optimality and duality theorems of convex programming. Symmetric derivatives are also used to extend some optimality and duality theorems involving pseudoconvexity and differentiable quasiconvexity.
Convex programming, Nonlinear programming
Convex programming, Nonlinear programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
