An outer approximate subdifferential method for piecewise affine optimization

Piecewise affine functions arise from Lagrangian duals of integer programming problems, and optimizing them provides good bounds for use in a branch and bound method. Methods such as the subgradient method and bundle methods assume only one subgradient is available at each point, but in many situations there is more information available. We present a new method for optimizing such functions, which is related to steepest descent, but uses an outer approximation to the subdifferential to avoid some of the numerical problems with the steepest descent approach. We provide convergence results for a class of outer approximations, and then develop a practical algorithm using such an approximation for the compact dual to the linear programming relaxation of the uncapacitated facility location problem. We make a numerical comparison of our outer approximation method with the projection method of Conn and Cornuéjols, and the bundle method of Schramm and Zowe.

Authors and Affiliations

1. Department of Engineering Science, University of Auckland, New Zealand, e-mail: p.neame@auckland.ac.nz, , , , , , NZ

   Philip Neame

2. Department of Mathematics and Statistics, University of Melbourne, Australia, , , , , , AU

   Natashia Boland & Daniel Ralph

Received September 10, 1998 / Revised version received August 1999¶Published online December 15, 1999

Reprints and permissions