60 search results - page 3 / 12 » Convex Relaxations for Subset Selection |
SIAMJO
2008
13 years 5 months ago
2008
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
ISBI
2002
IEEE
14 years 6 months ago
2002
IEEE
We investigate a new, fast and provably convergentMAP reconstruction algorithm for emission tomography. The new algorithm, termed C-OSEM has its origin in the alternating algorith...
ICASSP
2008
IEEE
14 years 18 days ago
2008
IEEE
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...
SDM
2010
SIAM
13 years 4 months ago
2010
SIAM
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
COCOS
2003
Springer
13 years 11 months ago
2003
Springer
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...