A Convex Optimization Approach to the Discrete Hanging Chain Problem

Abstract

In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a convex optimization problem. Then we use optimality conditions to show that the problem can be further reduced to solving a single non-linear equation, when the links of the chain have symmetric mass and length.