The following pages link to Dynamic bundle methods (Q2390994):
Displaying 4 items.
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
