To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...
In this paper, we consider the Lagrangian dual problem of a class of convex optimization problems. We first discuss the semismoothness of the Lagrangian-dual function . This prope...
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Sou...
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...