112 search results - page 16 / 23 » Approximate methods for convex minimization problems with se... |
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
CIMAGING
2009
14 years 9 months ago
2009
We present an extension of the development of an alternating minimization (AM) method1 for the computation of a specimen's complex transmittance function (magnitude and phase...
101
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
ML
2007
ACM
14 years 11 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...