A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Pixels in hyperspectral images usually contain spectra from several classifiable objects, so that the recorded pixel is a mixture of the classes. Current methods estimate the prop...
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...