The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
We consider infinite FPU-type atomic chains with general convex potentials and study the existence of monotone fronts that are heteroclinic travelling waves connecting constant asy...