
doi: 10.1007/bf01609002
The duality theorem of linear programming is used to prove several results on convex optimization. This is done without using separating hyerplane theorems.
Convex programming, Duality, Lagrange Multipliers, Constrained Convex Programming, Kuhn-Tucker Theorem
Convex programming, Duality, Lagrange Multipliers, Constrained Convex Programming, Kuhn-Tucker Theorem
| 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). | 2 | |
| 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. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
