Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1981
Data sources: zbMATH Open
https://doi.org/10.1007/bfb012...
Part of book or chapter of book . 1981 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

First and second order sufficient optimality conditions in mathematical programming and optimal control

Authors: Maurer, Helmut;

First and second order sufficient optimality conditions in mathematical programming and optimal control

Abstract

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.

Related Organizations
Keywords

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

  • BIP!
    Impact byBIP!
    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
Powered by OpenAIRE graph
Found an issue? Give us feedback
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).
BIP!Citations provided by BIP!
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.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
129
Top 10%
Top 1%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!