393 search results - page 28 / 79 » Convex Programming Methods for Global Optimization |
MP
2007
13 years 7 months ago
2007
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
TIT
2010
13 years 2 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
NIPS
2004
13 years 9 months ago
2004
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
ICCAD
1999
IEEE
13 years 12 months ago
1999
IEEE
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...