Pages that link to "Item:Q2757593"
From MaRDI portal
The following pages link to The efficiency of ballstep subgradient level methods for convex optimization (Q2757593):
Displaying 10 items.
- Convergence of a simple subgradient level method (Q1295965) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence (Q1717026) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Lagrangian Relaxation via Ballstep Subgradient Methods (Q5388054) (← links)