Pages that link to "Item:Q3712122"
From MaRDI portal
The following pages link to Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs (Q3712122):
Displaying 13 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Algorithms for quadratic constrained matrix problems (Q1200862) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343) (← links)
- Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (Q4840222) (← links)
