Speaker
Evelyn Herberg
Description
Cardinality constraints in optimization are commonly represented via L⁰-type constraints. One way of dealing with these constraints is reformulating the L⁰-constraint using the standard L¹-norm and the largest-K-norm, replacing the resulting constraint with a penalized version and solving the corresponding sequence of DC-type subproblems. We extend the DC-reformulation approach to problems with Gradient-L⁰ constraints, problems where sparsity of the gradient is the target.
