MINIMUM BLOCK-ANGULAR CONVEX PROGRAMMING

• INSTANCE: K disjoint convex compact sets $B^k$ called blocks, M nonnegative continuous convex functions $f^k_m: B^k\rightarrow R$.

• SOLUTION: A positive number $\lambda$ such that
  
  $$\sum_{k=1}^K f^k_m(x^k)\le\lambda \mbox{ for }1\le m\le M, \mbox{ and }x^k\in B^k\mbox{ for }1\le k\le K.$$
  
  

• MEASURE: $\lambda$.

  
  

• Good News: Admits an FPTAS [206].