Pages that link to "Item:Q5388054"

The following pages link to Lagrangian Relaxation via Ballstep Subgradient Methods (Q5388054):

Displaying 11 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)
• 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)
• 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)