f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Abstract-- Identification of output error models from frequency domain data generally results in a non-convex optimization problem. A well-known method to approach the output error...
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
Werner Trobin, Thomas Pock, Daniel Cremers, Horst ...
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...