Pages that link to "Item:Q2564623"
From MaRDI portal
The following pages link to Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623):
Displaying 22 items.
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← 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)
- 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)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Enhancing Lagrangian dual optimization for linear programs by obviating nondifferentiability (Q2892306) (← links)
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems (Q3771978) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- Joint vehicle assembly‐routing problems: An integrated modeling and optimization approach (Q5191146) (← links)
- A merit function approach to the subgradient method with averaging (Q5459823) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
