An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems

We give a bundle method for minimizing the sum of two convex functions, one of them being known only via an oracle of arbitrary accuracy. Each iteration involves solving two subproblems in which the functions are alternately represented by their linearizations. Our approach is motivated by applications to nonlinear multicommodity flow problems. Encouraging numerical experience on large scale problems is reported.

[1]  Jacek Gondzio,et al.  Solving nonlinear multicommodity flow problems by the analytic center cutting plane method , 1997, Math. Program..

[2]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[3]  Georgios Petrou,et al.  A bundle-type algorithm for routing in telecommunication data networks , 2009, Comput. Optim. Appl..

[4]  Giorgio Gallo,et al.  Shortest path algorithms , 1988 .

[5]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[6]  Jean-Philippe Vial,et al.  ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems , 2009, Math. Program..

[7]  Krzysztof C. Kiwiel,et al.  A Projection-Proximal Bundle Method for Convex Nondifferentiable Minimization , 1999 .

[8]  Claude Lemaréchal,et al.  An inexact bundle variant suited to column generation , 2009, Math. Program..

[9]  Jean-Philippe Vial,et al.  ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum , 2009, Math. Program..

[10]  B. Martinet.  Brève communication. Régularisation d'inéquations variationnelles par approximations successives , 1970 .

[11]  K. Kiwiel.  A Cholesky dual method for proximal piecewise linear programming , 1994 .

[12]  Torbjörn Larsson,et al.  Lagrangian Relaxation via Ballstep Subgradient Methods , 2007, Math. Oper. Res..

[13]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[14]  K. Kiwiel.  A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization , 1986 .

[15]  Antonio Frangioni,et al.  Solving semidefinite quadratic problems within nonsmooth optimization algorithms , 1996, Comput. Oper. Res..

[16]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..

[17]  Krzysztof C. Kiwiel.  A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming , 2006, SIAM J. Optim..

[18]  Krzysztof C. Kiwiel,et al.  A Proximal Bundle Method with Approximate Subgradient Linearizations , 2006, SIAM J. Optim..

[19]  Andrzej Ruszczynski,et al.  Proximal Decomposition Via Alternating Linearization , 1999, SIAM J. Optim..

[20]  Jean-Louis Goffin,et al.  The ellipsoid method and its predecessors , 1986 .