29 search results - page 1 / 6 » Solving Quadratic Multicommodity Problems through an Interio... |
80
Voted
IFIP7
2001
Springer
15 years 2 months ago
2001
Springer
VECPAR
2000
Springer
15 years 1 months ago
2000
Springer
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
SIAMJO
2000
14 years 9 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
101
click to vote
OL
2007
14 years 9 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...