716 search results - page 4 / 144 » Semilinear Program Feasibility |
AUTOMATICA
2007
13 years 10 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,...
OL
2010
13 years 8 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
DISOPT
2007
13 years 9 months ago
2007
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
CPAIOR
2009
Springer
14 years 4 months ago
2009
Springer
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
ICTA
2009
IEEE
14 years 4 months ago
2009
IEEE
1 WCAG 2.0 (W3C Recommendation 11 Dec. 2008) recommendation includes a specific guideline regarding the readability of text contents. This paper presents an approach to adapt text ...