Local saddle point and a class of convexification methods for nonconvex optimization problems (Q2460140): Difference between revisions

A class of general transformation methods is proposed to convert a nonconvex optimization problem to another equivalent problem. It is shown that under certain assumptions the existence of a local saddle point or local convexity of the Lagrangian function of the equivalent problem can be guaranteed. Numerical experiments are given to demonstrate the main results geometrically.