Pages that link to "Item:Q5926608"
From MaRDI portal
The following pages link to A modified subgradient algorithm for Lagrangean relaxation (Q5926608):
Displaying 15 items.
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- On the surrogate gradient algorithm for Lagrangian relaxation (Q946317) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Surrogate gradient algorithm for Lagrangian relaxation (Q1289401) (← links)
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem (Q1429768) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan (Q1632965) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
- Accelerating the convergence of subgradient optimisation (Q1847153) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- A modified BFGS bundle algorithm based on approximate subgradients (Q2868961) (← links)
- Modified Active Subspaces Using the Average of Gradients (Q4611538) (← links)
