Manifold relaxations for integer programming

Differential optimization in finite-dimensional spaces

“…A novel hybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, was proposed to consider the optimal design of finite precision FIR filters in [26]. Gradient descent methods can be applied to solve integer programming problems in [6]. In addition, many important dynamical systems were modeled by optimization problem coupled with differential equations [5,18,23,22] and gradient flow technique can help us to study the dynamical optimization problem.…”