Abstract
In this paper, we design a new variable target value procedure, the trust region target value (TRTV) method, for optimizing nondifferentiable Lagrangian dual formulations of large-scale, ill-conditioned linear programming problems. Such problems typically arise in the context of Lagrangian relaxation approaches and branch-and-bound/cut algorithms for solving linear mixed-integer programs. Subgradient optimization strategies are well-suited for this purpose and are popularly used, particularly in Lagrangian relaxation contexts, because of their simplicity in computation and mild memory requirements. However, they lack robustness and can often stall while yet remote from optimality. With this motivation, we design our proposed TRTV method to retain simplicity in computations, be theoretically convergent, as well as yield an effective and robust performance in practice. Furthermore, we augment this approach with dual refinement and primal recovery procedures based on outer-linearization and trust region strategies to further improve the accuracy of the resulting solutions and to derive primal solutions as well. Our computational study reveals a highly competitive performance of the proposed TRTV algorithm among several implemented nondifferentiable optimization procedures. Moreover, the dual refinement and primal recovery procedures help further reduce the optimality gap and promote attaining a relatively greater degree of primal feasibility as compared with several alternative ergodic primal recovery schemes. Also, the proposed method displays significantly lesser computational requirement than that of a commercial linear programming solver CPLEX.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adams WP, Sherali HD (1993) Mixed-integer bilinear-programming problems. Math Progr 59(3):279–305
Barahona F, Anbil R (2000) The volume algorithm: producing primal solutions with a subgradient method. Math Progr 87(3):385–399
Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: theory and algorithms, 2nd edn. Wiley, New York
Brännlund U (1993) On relaxation methods for nonsmooth convex optimization. Ph.D Dissertation, Department of Mathematics, Royal Institute of Technology, Stockholm Sweden
Camerini PM, Fratta L, Maffioli F (1975) On improving relaxation methods by modified gradient techniques. Math Progr Study 3:26–34
Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manage Sci 27(1):1–18
Goffin JL, Kiwiel KC (1999) Convergence of a simple subgradient level method. Math Progr 85(1):207–211
Held M, Wolfe P, Crowder H (1974) Validation of subgradient optimization. Math Progr 6(1): 62–88
Larsson T, Patriksson M, Stromberg AB (1999) Ergodic, primal convergence in dual subgradient schemes for convex programming. Math Progr 86(2):283–312
Lemarechal C (1977). Bundle methods in nonsmooth optimization. In: Lemarechal C, Mifflin R (eds). Nonsmooth optimization: IIASA proceeding series, vol. 3, Pergamon, New York, pp 79–109
Lim C (2004) Nondifferentiable optimization of lagrangian dual formulations for linear programs with recovery of primal solutions. Ph.D. Dissertation, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia
Lim C, Sherali HD (2004) Convergence and computational analyses for some variable target value and subgradient deflection methods. Comput Optim Appl (to appear)
Makela MM (2002) Survey of bundle methods for nonsmooth optimization. Optim Methods Softw 17(1):1–29
Marsten RE, Hogan WW, Blankenship JW (1975) The boxstep method for large-scale optimization. Oper Res 23(3):389–405
Mifflin R (1977) An algorithm for constrained optimization with semismooth functions. Math Oper Res 2(2):191–207
Polyak BT (1967) A general method of solving extremum problems. Sov Math 8(3):593–597
Polyak BT (1969) Minimization of unsmooth functionals. U.S.S.R. Comput Math Math Phys 9(3):14–29
Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
Sherali HD, Choi G (1996) Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. Oper Res Lett 19(3):105–113
Sherali HD, Choi G, Ansari Z (2001) Limited memory space dilation and reduction algorithms. Comput Optim Appl 19(1):55–77
Sherali HD, Choi G, Tuncbilek CH (2000) A variable target value method for nondifferentiable optimization. Oper Res Lett 26(1):1–8
Sherali HD, Lim C (2004) On embedding the volume algorithm in a variable target value method. Oper Res Lett 32(5):455–462
Sherali HD, Myers DC (1988) Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. Discr Appl Math 20(1):51–68
Sherali HD, Ulular O (1989) A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl Math Optim 20(2):193–221
Shor NZ (1985) Minimization methods for non-differentiable functions. Springer, Berlin Heidelberg New York
Shor NZ, Shabashova LP (1972) Solution of minimax problems by the method of generalized gradient descent with dilatation of the space. Kibernetika 8(1):82–88
Shor NZ, Zhurbenko NG (1971) A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients. Kibernetika 7(2):51–59
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been supported by the National Science Foundation under Grant Number DMI-0094462.
Rights and permissions
About this article
Cite this article
Lim, C., Sherali, H.D. A Trust Region Target Value Method for Optimizing Nondifferentiable Lagrangian Duals of Linear Programs. Math Meth Oper Res 64, 33–53 (2006). https://doi.org/10.1007/s00186-006-0071-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-006-0071-7