Global Optimization for Cardinality-Constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming

Global Optimization for Cardinality-Constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming

GERAD Research Center via YouTube Direct link

Intro

1 of 22

1 of 22

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Global Optimization for Cardinality-Constrained Minimum Sum-of-Squares Clustering via Semidefinite Programming

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Linear Programming Problem
  3. 3 Motivation
  4. 4 Background Knowledge
  5. 5 State of the art
  6. 6 Semidefinite programming
  7. 7 Block diagonal matrix
  8. 8 Branch bound algorithm
  9. 9 Cardinality constraint formulation
  10. 10 Cardinality constraint reformulation
  11. 11 Cardinality constraint relaxation
  12. 12 Postprocessing
  13. 13 Inequalities
  14. 14 Branching Strategy
  15. 15 Linear Constraints
  16. 16 Heuristics
  17. 17 Initial Set of Centers
  18. 18 Numerical Results
  19. 19 Instances
  20. 20 Results
  21. 21 Branching bound
  22. 22 Conclusion

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.