Pages that link to "Item:Q1013976"
From MaRDI portal
The following pages link to A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976):
Displaying 18 items.
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Solving a continuous local access network design problem with a stabilized central column generation approach (Q635164) (← links)
- Performances improvement of the column generation algorithm: application to vehicle routing problems (Q989834) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← 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)
- Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
- Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers (Q2138295) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
- An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function (Q3114592) (← links)
- On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems (Q5348470) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
