
There is a dual program linked with every nonlinear program. The dual objective function is called the Lagrangian; it is defined in terms of the original problem. This note presents a characterization of the Lagrangian subgradients under general conditions. The theorem follows from a result of Danskin [1] that can be used (see [2]) to characterize the Lagrangian directional derivatives. These characterizations are theoretically interesting and may be useful in computing optimal dual solutions. Rockafellar's outstanding book, [3], is used as a basic reference; it contains a wealth of background and historical information.
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). | 13 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
