Matrix representation and gradient flows for NP-hard problems

Over the past decade, a number of connections between continuous flows and numerical algorithms were established. Recently, Brockett and Wong reported a connection between gradient flows on the special orthogonal groupLO(n) and local search solutions for the assignment problem. In this paper, we describe a uniform formulation for certain NP-hard combinatorial optimization problems in matrix form and examine their connection with gradient flows onLO(n). For these problems, there is a correspondence between the so-called 2-opt solutions and asymptotically stable critical points of an associated gradient flow.

[1]  W. Symes.  The QR algorithm and scattering for the finite nonperiodic Toda Lattice , 1982 .

[2]  M. Chu.  On the Continuous Realization of Iterative Processes , 1988 .

[3]  D. Bayer,et al.  The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[4]  L. Faybusovich.  Hamiltonian structure of dynamical systems which solve linear programming problems , 1991 .

[5]  Narendra Karmarkar,et al.  An Interior Point Approach to a Tensor Optimization Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems , 1992, IPCO.

[6]  P. Deift,et al.  Ordinary differential equations and the symmetric eigenvalue problem , 1983 .

[7]  Claude-Alain Burdet.  Review of "Linear Optimization by W. Allen Spivey and Robert M. Thrall", Holt, Rinehart and Winston, 1970 , 1973, SMAP.

[8]  Mauricio G. C. Resende,et al.  An interior point algorithm to solve computationally difficult set covering problems , 1991, Math. Program..

[9]  L. Faybusovich.  Dynamical Systems which Solve Optimization Problems with Linear Constraints , 1991 .

[10]  R. Brockett.  Least squares matching problems , 1989 .

[11]  R. Brockett.  Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems , 1991 .

[12]  A. Sändig,et al.  Nonlinear Differential Equations , 1980 .

[13]  R. Brockett,et al.  A Gradient Flow for the Assignment Problem , 1991 .

[14]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[15]  David S. Watkins,et al.  On Rutishauser's approach to self-similar flows , 1990 .

[16]  W. Symes.  Hamiltonian group actions and integrable systems , 1980 .

[17]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.