Pages that link to "Item:Q757242"
From MaRDI portal
The following pages link to Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242):
Displaying 17 items.
- Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- An improved subgradient method for constrained nondifferentiable optimization (Q1317025) (← links)
- Channel allocation in cellular radio networks (Q1370712) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- A generalized subgradient method with relaxation step (Q1914075) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian (Q2494475) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
- Algorithms for quasiconvex minimization (Q3112506) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- Optimal prioritized channel allocation in cellular mobile systems (Q5926603) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
- Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations (Q6140717) (← links)
