3 search results - page 1 / 1 » A probabilistic analytic center cutting plane method for fea... |
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,...
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...