Title :
Convex Programming and Duality in Normed Space
Author :
Luenberger, David G.
Author_Institution :
Stanford Electronics Laboratories, Stanford University, Stanford, Calif. 94305
fDate :
7/1/1968 12:00:00 AM
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;
Journal_Title :
Systems Science and Cybernetics, IEEE Transactions on
DOI :
10.1109/TSSC.1968.300146
