225 search results - page 15 / 45 » Approximating Parameterized Convex Optimization Problems |
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
TSMC
2002
13 years 8 months ago
2002
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
A new blind channel estimation technique for multiple-input multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) systems is proposed. It estimates the channel pa...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...