Pages that link to "Item:Q1295965"
From MaRDI portal
The following pages link to Convergence of a simple subgradient level method (Q1295965):
Displaying 25 items.
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- 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)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← 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)
- Comments on ``Surrogate gradient algorithm for Lagrangian relaxation'' (Q933830) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- The effect of deterministic noise in subgradient methods (Q1960191) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand (Q2357249) (← links)
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm (Q2397581) (← links)
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
- Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
- A subgradient method with non-monotone line search (Q2696908) (← links)
- The efficiency of ballstep subgradient level methods for convex optimization (Q2757593) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures (Q4639125) (← links)
- Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← links)
- Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
- Projection algorithms with dynamic stepsize for constrained composite minimization (Q5225430) (← links)
- Superiorization with level control (Q5346628) (← links)
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations (Q6140717) (← links)
