Convex Programming and Duality in Normed Space

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.

This publication has 5 references indexed in Scilit: