  The robust truss topology optimization against the uncertain static external
load can be formulated as mixed-integer semidefinite programming. Although a
global optimal solution can be computed with a branch-and-bound method, it is
very time-consuming. This paper presents an alternative formulation,
semidefinite programming with complementarity constraints, and proposes an
efficient heuristic. The proposed method is based upon the convex-concave
procedure for DC (difference-of-convex) programming. It is shown that the
method can often find a practically reasonable truss design within the
computational cost of solving some dozen of convex optimization subproblems.
