D. Li and C. K. Ng
The research goal is to develop equivalent transformations for generating a saddle point for nonconvex optimization problems. A saddle point condition is a sufficient condition for optimality. A saddle point can be generated in an equivalent representation space for nonconvex optimization problems that do not have a saddle point in their original settings. Certain equivalent transformations may convexify the perturbation function and a zero duality gap can be thus achieved. This investigation would lead to some efficient dual search algorithms that ensure the global optimality for a class of nonconvex optimization problems.