Pages that link to "Item:Q1697974"
From MaRDI portal
The following pages link to On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974):
Displaying 10 items.
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- A computational evaluation of two subgradient search methods (Q1089257) (← links)
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem (Q1429768) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← links)
- Incremental Bundle Methods using Upper Models (Q4603045) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
