The following pages link to Dynamic bundle methods (Q2390994):
Displaying 7 items.
- An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
- New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← 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)
- Using general triangle inequalities within quadratic convex reformulation method (Q6175568) (← links)
- An asynchronous proximal bundle method (Q6665397) (← links)