Minimizing the sum of a convex function and a specially structured nonconvex function

A lineraly constrained global optimization problem is studied, where the objective function is the saum of a convex function g(x)a nd a nonconvex function f(x) satisfying a rank two condition. Roughly speaking, the latter means that all the nonconvexity of f(x) is concentrated on a linear manifold of dimension 2. A solution method based on exploiting this special structure is prop