112 search results - page 9 / 23 » Lagrangian Relaxation |
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
MP
2006
13 years 10 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
AMC
2006
13 years 11 months ago
2006
We develop numerical methods for solving nonlinear equations of conservation laws with flux function that depends on discontinuous coefficients. Using a relaxation approximation, ...
MOC
2010
13 years 5 months ago
2010
This paper could have been given the title: "How to positively and implicitly solve Euler equations using only linear scalar advections." The new relaxation method we pr...