A simple algorithm for a class of nonsmooth convex-concave saddle-point problems.
Yoel DroriShoham SabachMarc TeboullePublished in: Oper. Res. Lett. (2015)
Keyphrases
- saddle point
- convex concave
- variational inequalities
- primal dual
- discrete tomography
- penalty function
- learning algorithm
- convex hull
- objective function
- np hard
- dynamic programming
- higher dimensional
- maximum margin
- linear programming
- structured output
- worst case
- convex optimization
- fixed point
- structured prediction
- np hardness