The efficiency of ballstep subgradient level methods for convex optimization
From MaRDI portal
Recommendations
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Convergence of a simple subgradient level method
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- ``Efficient subgradient methods for general convex optimization
Cited in
(10)- An effective line search for the subgradient method
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Primal convergence from dual subgradient methods for convex optimization
- ``Efficient subgradient methods for general convex optimization
- On some difficult linear programs coming from set partitioning
- Efficiency of proximal bundle methods
- A subgradient method based on gradient sampling for solving convex optimization problems
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- Lagrangian Relaxation via Ballstep Subgradient Methods
This page was built for publication: The efficiency of ballstep subgradient level methods for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757593)
