A duality theorem for convex programs

作者： W. S. Dorn

关键词: Danskin's theorem 、 Proper convex function 、 Mathematics 、 Discrete mathematics 、 Subderivative 、 Krein–Milman theorem 、 Convex analysis 、 Convex combination 、 Convex set 、 Convex optimization

摘要: A proof is given for a duality theorem class of convex programs, i.e., constrained minimization functions. simple example included.