Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability
From MaRDI portal
Recommendations
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- A technique for speeding up the solution of the Lagrangean dual
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Convergence and computational analyses for some variable target value and subgradient deflection methods
Cited in
(8)- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
- An exact algorithm for the precedence-constrained single-machine scheduling problem
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization
This page was built for publication: Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892306)
