  As a judicious correspondence to the classical maxcut, the anti-Cheeger cut
has more balanced structure, but few numerical results on it have been reported
so far. In this paper, we propose a continuous iterative algorithm for the
anti-Cheeger cut problem through fully using an equivalent continuous
formulation. It does not need rounding at all and has advantages that all
subproblems have explicit analytic solutions, the objection function values are
monotonically updated and the iteration points converge to a local optima in
finite steps via an appropriate subgradient selection. It can also be easily
combined with the maxcut iterations for breaking out of local optima and
improving the solution quality thanks to the similarity between the
anti-Cheeger cut problem and the maxcut problem. Numerical experiments on G-set
demonstrate the performance.
