Optimization Online


ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems

Frederic Babonneau (frederic.babonneau***at***hec.unige.ch)
Jean-Philippe Vial (jean-philippe.vial***at***hec.unige.ch)

Abstract: This paper proposes an implementation of a constrained analytic center cutting plane method to solve nonlinear multicommodity flow problems. The new approach exploits the property that the objective of the Lagrangian dual problem has a smooth component with second order derivatives readily available in closed form. The cutting planes issued from the nonsmooth component and the epigraph set of the smooth component form a localization set that is endowed with a self-concordant augmented barrier. Our implementation uses an approximate analytic center associated with that barrier to query the oracle of the nonsmooth component. The paper also proposes an approximation scheme for the original objective. An active set strategy can be applied to the transfomed problem: it reduces the dimension of the dual space and accelerates computations. The new approach solves huge instances with high accuracy. The method is compared to alternative approaches proposed in the literature.

Keywords: Constrained ACCPM, approximation scheme, active set strategy

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Network Optimization

Citation: Technical report, Logilab, University of Geneva, 2005

Download: [PDF]

Entry Submitted: 06/09/2005
Entry Accepted: 06/13/2005
Entry Last Modified: 06/09/2005

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society