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...
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Let F be a family of translates of a fixed convex set M in Rn. Let (F) and (F) denote the transversal number and the independence number of F, respectively. We show that (F) (F) 8...
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pels...
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
We present a procedure to split (or segment) touching numerals. We are neither assuming a dominant orientation for the text direction nor long character strings. The basic idea is...