
Summary: The aim of this paper is to establish formulas for the subdifferentials of the sum and the composition of convex functions in terms of the subdifferentials of the data functions at nearby points. Applications to general optimization problems lead to a new notion of sequential Lagrange multipliers.
Programming in abstract spaces, Convex programming, Calculus of functions on infinite-dimensional spaces, Convex functions and convex programs in convex geometry, sequential Lagrange multipliers, Nonsmooth analysis, sequential subdifferential calculus, subdifferentials, \(\varepsilon\)-subdifferential
Programming in abstract spaces, Convex programming, Calculus of functions on infinite-dimensional spaces, Convex functions and convex programs in convex geometry, sequential Lagrange multipliers, Nonsmooth analysis, sequential subdifferential calculus, subdifferentials, \(\varepsilon\)-subdifferential
| 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). | 58 | |
| 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 |
