L) primal-dual potential reduction algorithm for solving convex quadratic programs.
Donald GoldfarbShucheng LiuPublished in: Math. Program. (1993)
Keyphrases
- quadratic program
- primal dual
- convex optimization
- linear program
- linear programming
- approximation algorithms
- convex constraints
- linear programming problems
- interior point methods
- convex optimization problems
- interior point algorithm
- convex programming
- quadratic programming
- simplex method
- semidefinite programming
- algorithm for linear programming
- interior point
- mixed integer
- np hard
- objective function
- variational inequalities
- maximum margin
- saddle point
- column generation
- convex relaxation
- total variation
- feature selection
- convex functions
- optimal solution
- dynamic programming
- semi definite programming
- convex sets
- nonlinear programming
- semidefinite
- machine learning
- feasible solution
- markov random field
- higher order
- worst case
- upper bound
- computational complexity
- learning algorithm