Pages that link to "Item:Q5388054"
From MaRDI portal
The following pages link to Lagrangian Relaxation via Ballstep Subgradient Methods (Q5388054):
Displaying 16 items.
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation'' (Q933830) (← links)
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem (Q1429768) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design (Q2514794) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- Auction Design for the Efficient Allocation of Service Capacity Under Congestion (Q3195236) (← links)
- Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
