Pages that link to "Item:Q1961980"
From MaRDI portal
The following pages link to Ergodic, primal convergence in dual subgradient schemes for convex programming (Q1961980):
Displayed 32 items.
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- ``Cap and trade'' for congestion control (Q369468) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Minimum-energy wireless real-time multicast by joint network coding and scheduling optimization (Q1665573) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- An efficient algorithm for \(\ell_{0}\) minimization in wavelet frame based image restoration (Q1945380) (← links)
- Portfolio optimization with two coherent risk measures (Q2022182) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
- A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem (Q2815470) (← links)
- Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods (Q2834559) (← links)
- Bayesian Trigonometric Support Vector Classifier (Q4816940) (← links)
- A merit function approach to the subgradient method with averaging (Q5459823) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)