• DocumentCode
    790504
  • Title

    Convexity and the maximum principle for discrete systems

  • Author

    Holtzman, Jack M.

  • Author_Institution
    Bell Telephone Labs., Whipany, NJ, USA
  • Volume
    11
  • Issue
    1
  • fYear
    1966
  • fDate
    1/1/1966 12:00:00 AM
  • Firstpage
    30
  • Lastpage
    35
  • Abstract
    Halkin has given a derivation of the discrete maximum principle using a convexity requirement. An example given in this paper shows that incorrect results may be obtained when Halkin´s convexity requirement is not met. There are, however, systems that do not satisfy the convexity requirement, but for which there is still a maximum principle. The discrete maximum principle is rederived with a requirement, directional convexity, that is weaker than convexity and which considerably extends its applicability. Though convexity has appeared to be basic in the development of optimal control theory, it is only the weaker property of directional convexity which is required for much of the development.
  • Keywords
    Linear systems, time-varying discrete-time; Optimal control; Filtering; Filters; Game theory; Helium; Optimal control; Servomechanisms; Smoothing methods; Statistics; Telephony;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.1966.1098235
  • Filename
    1098235