| Q. ZHAO, S.E. KARISCH, F. RENDL, and H. WOLKOWICZ. Semide nite programming relaxations for the quadratic assignment problem. J. Comb. Optim., 2(1):71-109, 1998. |
....They used the dual scaling interior point method described in [3] but solve the associated SCE in each iteration by a preconditioned conjugate gradient method. Earlier works on using preconditioned conjugate gradient methods to solve the SCE in interior point methods for SDP include [14] and [24]. As far as we are aware, all the earlier works mentioned above use diagonal or block diagonal preconditioners. These preconditioners are ine ective when the Schur complement matrix becomes more and more ill conditioned as the interior point iterates approach an optimal solution. Though attempts ....
Q. Zhao, S.E. Karisch, F. Rendl, and H. Wolkowicz, Semidenite programming relaxations for the quadratic assignment problem, Technical Report, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 1996. 29
....work of Goemans and Williamson [4] Also see Nesterov [8] and Ye [11] for some extensions and generalizations. However, most relevant to the current paper are the applications of computational SDP techniques for certain combinatorial optimization problems such as Zhao, Karisch, Rendl and Wolkowicz [12], Wolkowicz and Zhao [10] and Benson and Ye [2] These papers determine the ane hull of the feasible solutions of the particular SDP relaxations and construct some Slater points for such SDP relaxations (for speci c combinatorial optimization problems) Our proofs are much shorter and apply much ....
Q. Zhao, S. E. Karisch, F. Rendl and H. Wolkowicz, Semidenite programming relaxations for the quadratic assignment problem, J. Combinatorial Optimization, to appear.
No context found.
Q. ZHAO, S.E. KARISCH, F. RENDL, and H. WOLKOWICZ. Semide nite programming relaxations for the quadratic assignment problem. J. Comb. Optim., 2(1):71-109, 1998.
No context found.
Q. ZHAO, S.E. KARISCH, F. RENDL, and H. WOLKOWICZ. Semide nite programming relaxations for the quadratic assignment problem. J. Comb. Optim., 2(1):71-109, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC