On embedding the volume algorithm in a variable target value method

We employ the volume algorithm as a subgradient deflection strategy in a variable target value method for solving nondifferentiable optimization problems. Focusing on Lagrangian duals for LPs, we exhibit primal nonconvergence of the original method, establish convergence of the proposed algorithm in the dual space, and present related computational results.

[1]  J. Ben Rosen,et al.  Pracniques: construction of nonlinear programming test problems , 1965, Commun. ACM.

[2]  Boris Polyak Minimization of unsmooth functionals , 1969 .

[3]  Francisco Barahona,et al.  Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut , 2006, RAIRO Oper. Res..

[4]  H. Sherali,et al.  A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems , 1989 .

[5]  Michael Patriksson,et al.  Ergodic, primal convergence in dual subgradient schemes for convex programming , 1999, Mathematical programming.

[6]  Churlzu Lim,et al.  Nondifferentiable Optimization of Lagrangian Dual Formulations for Linear Programs with Recovery of Primal Solutions , 2004 .

[7]  J. B. Rosen,et al.  Construction of nonlinear programming test problems , 1965 .

[8]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[9]  Nelson Maculan,et al.  The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..

[10]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[11]  Hanif D. Sherali,et al.  Mixed-integer bilinear programming problems , 1993, Math. Program..

[12]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[13]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[14]  Hanif D. Sherali,et al.  A variable target value method for nondifferentiable optimization , 2000, Oper. Res. Lett..

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

[16]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[17]  Hanif D. Sherali,et al.  Limited Memory Space Dilation and Reduction Algorithms , 2001, Comput. Optim. Appl..

[18]  Hanif D. Sherali,et al.  Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..