Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm.
Nathan Benedetto ProençaMarcel K. de Carli SilvaCristiane M. SatoLevent TunçelPublished in: CoRR (2024)
Keyphrases
- primal dual
- linear programming
- learning algorithm
- approximation algorithms
- dynamic programming
- simplex algorithm
- convergence rate
- computational complexity
- worst case
- probabilistic model
- analytic center
- np hard
- interior point algorithm
- semidefinite programming
- simplex method
- dual formulation
- search direction
- infeasible interior point
- linear programming problems
- randomly generated
- convex optimization
- linear program
- evolutionary algorithm
- image processing