
doi: 10.1007/bfb0120927
First and second order sufficient conditions are given for infinite-dimensional programming problems with constraints defined by arbitrary closed convex cones. The sufficient conditions are formulated by means of two norms and, thereby, are applicable to optimal control problems with state constraints where the definiteness conditions can only hold in a weaker norm than that in which the functions involved are differentiable. The second order sufficient conditions yield an extension of the classical Riccati-type conditions.
Programming in abstract spaces, Normed linear spaces and Banach spaces; Banach lattices, optimal control, real Banach space, Lagrange multipliers, optimality conditions, two-norm discrepancy, closed convex cone constraints, second order sufficient conditions, disconjugacy, first order sufficient conditions, infinite-dimensional programming, Riccati-type conditions
Programming in abstract spaces, Normed linear spaces and Banach spaces; Banach lattices, optimal control, real Banach space, Lagrange multipliers, optimality conditions, two-norm discrepancy, closed convex cone constraints, second order sufficient conditions, disconjugacy, first order sufficient conditions, infinite-dimensional programming, Riccati-type conditions
| 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). | 129 | |
| 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 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
