Pages that link to "Item:Q1970420"
From MaRDI portal
The following pages link to A variable target value method for nondifferentiable optimization (Q1970420):
Displayed 21 items.
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem (Q337462) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Stochastic programming approach to process flexibility design (Q613618) (← 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)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Service system design for managing interruption risks: a backup-service risk-mitigation strategy (Q1634282) (← 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 inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand (Q2357249) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm (Q2397581) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian (Q2494475) (← links)
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
- Designing service system networks with interruption risks (Q6066674) (← links)