• DocumentCode
    1082175
  • Title

    Convex Programming and Duality in Normed Space

  • Author

    Luenberger, David G.

  • Author_Institution
    Stanford Electronics Laboratories, Stanford University, Stanford, Calif. 94305
  • Volume
    4
  • Issue
    2
  • fYear
    1968
  • fDate
    7/1/1968 12:00:00 AM
  • Firstpage
    182
  • Lastpage
    188
  • Abstract
    This paper describes some extensions of classical convex programming to problems formulated on an abstract normed space. The utility of the normed-space formulation is illustrated by some simple applications.
  • Keywords
    Contracts; Convergence; Cybernetics; Differential equations; Functional analysis; Helium; Lagrangian functions; Optimal control; Optimization methods;
  • fLanguage
    English
  • Journal_Title
    Systems Science and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0536-1567
  • Type

    jour

  • DOI
    10.1109/TSSC.1968.300146
  • Filename
    4082138
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1082175