Twisted and Nontwisted Bifurcations Induced by Diffusion

We discuss a diffusively perturbed predator-prey system. Freedman and Wolkowicz showed that the corresponding ODE can have a periodic solution that bifurcates from a homoclinic loop. When the diffusion coefficients are large, this solution represents a stable, spatially homogeneous time-periodic solution of the PDE. We show that when the diffusion coefficients become small, the spatially homogeneous periodic solution becomes unstable and bifurcates into spatially nonhomogeneous periodic solutions. The nature of the bifurcation is determined by the twistedness of an equilibrium/homoclinic bifurcation that occurs as the diffusion coefficients decrease. In the nontwisted case two spatially nonhomogeneous simple periodic solutions of equal period are generated, while in the twisted case a unique spatially nonhomogeneous double periodic solution is generated through period-doubling. Key Words: Reaction-diffusion equations; predator-prey systems; homoclinic bifurcations; periodic solutions.Comment: 42 pages in a tar.gz file. Use ``latex2e twisted.tex'' on the tex files. Hard copy of figures available on request from [email protected]

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming

Semidefinite programming has been used successfully to build hierarchies of convex relaxations to approximate polynomial programs. This approach rapidly becomes computationally expensive and is often tractable only for problems of small sizes. We propose an iterative scheme that improves the semidefinite relaxations without incurring exponential growth in their size. The key ingredient is a dynamic scheme for generating valid polynomial inequalities for general polynomial programs. These valid inequalities are then used to construct better approximations of the original problem. As a result, the proposed scheme is in principle scalable to large general combinatorial optimization problems. For binary polynomial programs, we prove that the proposed scheme converges to the global optimal solution for interesting cases of the initial approximation of the problem. We also present examples illustrating the computational behaviour of the scheme and compare it to other methods in the literature