On embedding the volume algorithm in a variable target value method.

DOI10.1016/j.orl.2003.12.006zbMath1054.90054OpenAlexW2041715582MaRDI QIDQ703259

Churlzu Lim, Hanif D. Sherali

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.12.006

zbMATH Keywords

Lagrangian relaxationNondifferentiable optimizationVariable target value methodVolume algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items

Convergence and computational analyses for some variable target value and subgradient deflection methods, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, Stochastic programming for qualification management of parallel machines in semiconductor manufacturing, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization, Primal convergence from dual subgradient methods for convex optimization

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixed-integer bilinear programming problems
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
• The volume algorithm revisited: relation with bundle methods
• The volume algorithm: Producing primal solutions with a subgradient method
• Ergodic, primal convergence in dual subgradient schemes for convex programming
• A variable target value method for nondifferentiable optimization
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
• Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Minimization of unsmooth functionals
• Limited memory space dilation and reduction algorithms