Skip to main content
SpringerLink
Log in

Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We consider two variable target value frameworks for solving large-scale nondifferentiable optimization problems. We provide convergence analyses for various combinations of these variable target value frameworks with several direction-finding and step-length strategies including the pure subgradient method, the volume algorithm, the average direction strategy, and a generalized Polyak-Kelley cutting plane method. In addition, we suggest a further enhancement via a projected quadratic-fit line-search whenever any of these algorithmic procedures experiences an improvement in the objective value. Extensive computational results on different classes of problems reveal that these modifications and enhancements significantly improve the effectiveness of the algorithms to solve Lagrangian duals of linear programs, even yielding a favorable comparison against the commercial software CPLEX 8.1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Barahona and R. Anbil, “The volume algorithm: Producing primal solutions with a subgradient method,” Mathematical Programming, vol. 87, no. 3, pp. 385–399, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  2. M.S. Bazaraa and H.D. Sherali, “On the choice of step size in subgradient optimization,” European Journal of Operational Research, vol. 7, no. 4, pp. 380–388, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  3. M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., John Wiley & Sons, New York, 1993.

    MATH  Google Scholar 

  4. J.E. Beasley, “OR-library: distributing test problems by electronic mail,” Journal of the Operational Research Society, vol. 41, no. 11, pp. 1069–1072, 1990.

    Article  Google Scholar 

  5. U. Brännlund, “On relaxation methods for nonsmooth convex optimization,” Ph.D Dissertation, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 1993.

  6. P.M. Camerini, L. Fratta, and F. Maffioli, “On improving relaxation methods by modified gradient techniques,” Mathematical Programming Study, vol. 3, pp. 26–34, 1975.

    MathSciNet  Google Scholar 

  7. M.L. Fisher, “The Lagrangian relaxation method for solving integer programming problems,” Management Science, vol. 27, no. 1, pp. 1–18, 1981.

    MATH  MathSciNet  Google Scholar 

  8. F. Fumero, “A modified subgradient algorithm for Lagrangean relaxation,” Computers & Operations Research, vol. 28, no. 1, pp. 33–52, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.L. Goffin and K.C. Kiwiel, “Convergence of a simple subgradient level method,” Mathematical Programming, vol. 85, no. 1, pp. 207–211, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Held, P. Wolfe, and H. Crowder, “Validation of subgradient optimization,” Mathematical Programming, vol. 6, no. 1, pp. 62–88, 1974.

    Article  MathSciNet  MATH  Google Scholar 

  11. S. Kim, H. Ahn, and S. Cho, “Variable target value subgradient method,” Mathematical Programming, vol. 49, no. 3, pp. 359–369, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  12. K.C. Kiwiel, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer, Berlin, 1985.

  13. K.C. Kiwiel, “Proximity control in bundle methods for convex nondifferentiable minimization” Mathematical Programming, vol. 46, no. 1, pp. 105–122, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. Lemarechal, “Bundle method in nonsmooth optimization,” in Nonsmooth Optimization: Proceedings of IIASA Workshop held at Laxenburg, Austria, C. Lemarechal and R. Mifflin (Eds.), vol. 3, pp. 79–109, 1977.

  15. C. Lim, “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, 2004.

  16. M.M. Makela, “Survey of bundle methods for nonsmooth optimization,” Optimization Methods and Software, vol. 17, no. 1, pp. 1–29, 2002.

    Article  MathSciNet  Google Scholar 

  17. R. Mifflin, “An algorithm for constrained optimization with semismooth functions,” Mathematics of Operations Research, vol. 2, no. 2, pp. 191–207, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  18. B.T. Polyak, “A general method of solving extremum problems,” Soviet Mathematics, vol. 8, no. 3, pp. 593–597, 1967.

    MATH  Google Scholar 

  19. B.T. Polyak, “Minimization of unsmooth functionals,” U.S.S.R. Computational Mathematics and Mathematical Physics, vol. 9, no. 3, pp. 14–29, 1969.

    Article  Google Scholar 

  20. H.D. Sherali, G. Choi, and Z. Ansari, “Limited memory space dilation and reduction algorithms,” Computational Optimization and Applications, vol. 19, no. 1, pp. 55–77, 2001.

    Article  MathSciNet  MATH  Google Scholar 

  21. H.D. Sherali, G. Choi, and C.H. Tuncbilek, “A variable target value method for nondifferentiable optimization,” Operations Research Letters, vol. 26, no. 1, pp. 1–8, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  22. H.D. Sherali, and C. Lim, “On embedding the volume algorithm in a variable target value method,” Operations Research Letters, vol. 32, no. 5, pp. 455–462, 2004.

    Article  MathSciNet  MATH  Google Scholar 

  23. H.D. Sherali and D.C. Myers, “Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs,” Discrete Applied Mathematics, vol. 20, no. 1, pp. 51–68, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  24. H.D. Sherali and O. Ulular, “A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems,” Applied Mathematics and Optimization, vol. 20, no. 2, pp. 193–221, 1989.

    MathSciNet  MATH  Google Scholar 

  25. N.Z. Shor, “Utilization of the operation of space dilatation in the minimization of convex functions,” Kibernetika, vol. 6, no. 1, pp. 6–12, 1970.

    MATH  MathSciNet  Google Scholar 

  26. N.Z. Shor, Minimization Methods for Non-Differentiable Functions, Springer-Verlag, 1985.

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Churlzu Lim & Hanif D. Sherali

Authors
  1. Churlzu Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanif D. Sherali.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lim, C., Sherali, H.D. Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods. Comput Optim Applic 34, 409–428 (2006). https://doi.org/10.1007/s10589-005-3914-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-005-3914-x

Keywords

Search

Navigation