Pages that link to "Item:Q1338808"
From MaRDI portal
The following pages link to A Cholesky dual method for proximal piecewise linear programming (Q1338808):
Displayed 19 items.
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)
- A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)