Ergodic, primal convergence in dual subgradient schemes for convex programming
From MaRDI portal
Publication:1961980
DOI10.1007/s101070050090zbMath0946.90059OpenAlexW2041221438MaRDI QIDQ1961980
Torbjörn Larsson, Ann-Brith Strömberg, Michael Patriksson
Publication date: 30 January 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050090
Lagrangean relaxationconvex programmingergodic convergencesubgradient optimizationroad pricingLagrangean dualitytraffic equilibrium assignment
Related Items
A weighted mirror descent algorithm for nonsmooth convex optimization problem, Bayesian Trigonometric Support Vector Classifier, A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs, Exact makespan minimization of unrelated parallel machines, Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization, ``Cap and trade for congestion control, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration, A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., Comparison of bundle and classical column generation, Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, On embedding the volume algorithm in a variable target value method., Portfolio optimization with two coherent risk measures, The omnipresence of Lagrange, Dual subgradient method with averaging for optimal resource allocation, A fast exact method for the capacitated facility location problem with differentiable convex production costs, Hub-and-spoke network design and fleet deployment for string planning of liner shipping, A merit function approach to the subgradient method with averaging, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, Two ``well-known properties of subgradient optimization, A feasibility-ensured Lagrangian heuristic for general decomposable problems, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, Subgradient methods for saddle-point problems, An inexact primal-dual algorithm for semi-infinite programming, A primal-proximal heuristic applied to the French unit-commitment problem, Primal convergence from dual subgradient methods for convex optimization, Primal recovery from consensus-based dual decomposition for distributed convex optimization, About Lagrangian methods in integer optimization
