Maximal monotone operator theory is about to turn (or just has turned) fifty. I intend to briefly survey the history of the subject. I shall try to explain why maximal monotone ...
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow ea...
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...