Pages that link to "Item:Q1914075"
From MaRDI portal
The following pages link to A generalized subgradient method with relaxation step (Q1914075):
Displaying 10 items.
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← 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)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
- Optimization of subgradient method parameters on the base of rank-two correction of metric matrices (Q5878623) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)