Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal.
Alberto CostaLeo LibertiPublished in: SEA (2012)
Keyphrases
- dual variables
- linear programming
- primal dual
- convex optimization
- convex relaxation
- duality gap
- dual formulation
- convex programming
- semidefinite
- linear program
- affine scaling
- algorithm for linear programming
- convex optimization problems
- interior point methods
- semidefinite programming
- convex functions
- higher order
- lower bound
- quadratically constrained quadratic
- cutting plane algorithm
- augmented lagrangian
- variational inequalities
- lagrangian dual
- lagrangian relaxation
- inequality constraints
- optimal solution
- np hard
- dynamic programming
- feasible solution
- simplex algorithm
- linear programming problems
- column generation
- high order
- linear programming relaxation
- piecewise linear
- approximation algorithms
- objective function
- multi label
- nonlinear programming
- energy function
- principal component analysis
- convergence rate
- upper bound
- cutting plane
- total variation
- special case
- pairwise
- feature space