Convergence of the surrogate Lagrangian relaxation method
From MaRDI portal
Publication:2260658
Recommendations
- Surrogate gradient algorithm for Lagrangian relaxation
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- On the surrogate gradient algorithm for Lagrangian relaxation
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- Approximate subgradient methods for Lagrangian relaxations on networks
Cites work
- A computational study of exact knapsack separation for the generalized assignment problem
- A generalization of Polyak's convergence result for subgradient optimization
- A genetic algorithm for the generalised assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- A variable depth search algorithm with branching search for the generalized assignment problem
- An Exact Algorithm for the Quadratic Assignment Problem on a Tree
- An exact method with variable fixing for solving the generalized assignment problem
- Assignment Problems and the Location of Economic Activities
- Bees algorithm for generalized assignment problem
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- Convergence of a simple subgradient level method
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
- scientific article; zbMATH DE number 2089255 (Why is no real title available?)
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 3516935 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Minimization of unsmooth functionals
- New variants of bundle methods
- On the surrogate gradient algorithm for Lagrangian relaxation
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Smooth minimization of non-smooth functions
- Surrogate gradient algorithm for Lagrangian relaxation
- Tabu search for the multilevel generalized assignment problem
Cited in
(12)- Surrogate gradient algorithm for Lagrangian relaxation
- Stochastic programming for qualification management of parallel machines in semiconductor manufacturing
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation
- A review of decentralized optimization focused on information flows of decomposition algorithms
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Accelerating level-value adjustment for the Polyak stepsize
- New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion
- A joint scheduling approach for production and material handling under customized manufacturing paradigm
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation
- On the surrogate gradient algorithm for Lagrangian relaxation
This page was built for publication: Convergence of the surrogate Lagrangian relaxation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260658)
