Pages that link to "Item:Q2499376"
From MaRDI portal
The following pages link to Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376):
Displaying 10 items.
- A subgradient method for solving multiproduct network development problems with survivability guarantees (Q1323948) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Subdivision schemes, network flows and linear optimization (Q2355177) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Accelerated Dual Descent for Network Flow Optimization (Q2983197) (← links)
- On primal convergence for augmented Lagrangian duality (Q3112497) (← links)
- Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
- A Newton method for convex separable network flow problems (Q3668258) (← links)
- Subgradient Methods for the Service Network Design Problem (Q4319316) (← links)
- Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks (Q5391886) (← links)