Lagrangian Relaxation via Ballstep Subgradient Methods

DOI10.1287/moor.1070.0261zbMath1341.90100OpenAlexW2149192560WikidataQ30040525 ScholiaQ30040525MaRDI QIDQ5388054

Krzysztof C. Kiwiel, Torbjörn Larsson, Per Olov Lindberg

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://rcin.org.pl/dlibra/publication/edition/139438/content

zbMATH Keywords

Lagrangian relaxationconvex programmingnondifferentiable optimizationsubgradient optimizationlevel projection methods

Mathematics Subject Classification ID

Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Deterministic network models in operations research (90B10)

Related Items (11)

A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Auction Design for the Efficient Allocation of Service Capacity Under Congestion ⋮ A bundle-type algorithm for routing in telecommunication data networks ⋮ An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ An inexact primal-dual algorithm for semi-infinite programming ⋮ Primal convergence from dual subgradient methods for convex optimization

This page was built for publication: Lagrangian Relaxation via Ballstep Subgradient Methods