Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs

This publication has 8 references indexed in Scilit:

• A reformulation-convexification approach for solving nonconvex quadratic programming problems
  Journal of Global Optimization, 1995
• Mixed-integer bilinear programming problems
  Mathematical Programming, 1993
• A squared-euclidean distance location-allocation problem
  Naval Research Logistics (NRL), 1992
• Convergence of a generalized subgradient method for nondifferentiable convex optimization
  Mathematical Programming, 1991
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
  Applied Mathematics & Optimization, 1989
• A class of convergent primal-dual subgradient algorithms for decomposable convex programs
  Mathematical Programming, 1986
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
  Management Science, 1981
• On improving relaxation methods by modified gradient techniques
  Published by Springer Nature ,1975