ProbXiv
Explorersign in
Problem archiveProblem record

Statement

It remains an open question to construct a minimal decomposition in general dimensions, or to describe a finite procedure to compute it. CWPL function f : Rn \to R can be written as the difference f = g − h of two convex CPWL functions [2, 4]. Consequently, a natural idea to circumvent the challenges induced by nonconvexity is to use such a decomposition f = g − h and solve the desired problem separately for g and h. However, the crucial question arising from this strategy is: how much more complex are g and h compared to f ? A well-established measure for the complexity of a CPWL function is the number of its linear pieces. Therefore, the main question we study is the following. Problem 1. How to decompose a CPWL function f into a difference f = g − h of two convex CPWL functions with as few pieces as possible? There exist many ways in the literature to obtain such a decomposition, but none of them guarantees minimality or at least a useful bound on the number of pieces of g and h depending on those of f . In fact, no finite procedure is known that guarantees to find a minimal decomposition, with the exception of a recent solution for special cases in dimension 2 [3]. We propose a novel perspective on Problem 1 making use of polyhedral geome- try. Instead of aiming for a globally optimal decomposition, we restrict to Mini-Workshop: Alcoved Polytopes in Physics and Optimization 553

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.