219 search results - page 2 / 44 » Solving Semi-infinite Linear Programs Using Boosting-Like Me... |
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
CAV
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
DIS
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
SIAMJO
2000
13 years 4 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...