The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
From MaRDI portal
Publication:2757593
DOI10.1287/moor.24.1.237zbMath0977.90036OpenAlexW1974645784MaRDI QIDQ2757593
Krzysztof C. Kiwiel, Torbjörn Larsson, Per Olov Lindberg
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.24.1.237
convex programmingnondifferentiable optimizationsubgradient optimizationrelaxation methodslevel projection methods
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
On some difficult linear programs coming from set partitioning ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence ⋮ Non-Euclidean restricted memory level method for large-scale convex optimization ⋮ An effective line search for the subgradient method ⋮ A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems ⋮ Efficiency of proximal bundle methods ⋮ Primal convergence from dual subgradient methods for convex optimization
This page was built for publication: The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
