Pages that link to "Item:Q1847153"
From MaRDI portal
The following pages link to Accelerating the convergence of subgradient optimisation (Q1847153):
Displaying 12 items.
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization (Q421765) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A Lagrangian approach for minimum cost single round robin tournaments (Q1762030) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization (Q2129627) (← links)
- (Q3730342) (← links)
- Convex Synthesis of Accelerated Gradient Algorithms (Q5020736) (← links)
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
- (Q5432767) (← links)
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
