30 search results - page 4 / 6 » A cutting plane method for solving KYP-SDPs |
GLOBECOM
2008
IEEE
14 years 3 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 ...
AUSSOIS
2001
Springer
14 years 1 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
IOR
2011
13 years 3 months ago
2011
We formulate a risk-averse two-stage stochastic linear programming problem in which unresolved uncertainty remains after the second stage. The objective function is formulated as ...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomp...
SIAMJO
2010
13 years 3 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...