6 search results - page 1 / 2 » A Multiple-Cut Analytic Center Cutting Plane Method for Semi... |
SIAMJO
2002
13 years 4 months ago
2002
MOR
2002
13 years 4 months ago
2002
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
AUTOMATICA
2007
13 years 5 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
MANSCI
2008
13 years 4 months ago
2008
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper, we propose a method for support vector machine classification using indefinite kernels. Instead of directly minimizing or stabilizing a nonconvex loss function, our...