Approximate methods for convex minimization problems with series-parallel structure


Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series-parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in… (More)
DOI: 10.1016/j.ejor.2006.04.052


3 Figures and Tables

Slides referencing similar topics