Polyhedral Approximations in Convex Optimization
Published on Dec 20, 200813107 Views
We propose a unifying framework for solution of convex programs by polyhedral approximation. It includes classical methods, such as cutting plane, Dantzig-Wolfe decomposition, bundle, and simplicial d