270 search results - page 40 / 54 » Constraint relaxation in approximate linear programs |
85
Voted
SIAMJO
2002
15 years 3 days ago
2002
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
101
Voted
COR
2010
15 years 17 days ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
106
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
PIMRC
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
118
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...