A primal-dual regularized interior-point method for convex quadratic programs.
Michael P. FriedlanderDominique OrbanPublished in: Math. Program. Comput. (2012)
Keyphrases
- quadratic program
- primal dual
- interior point methods
- convex optimization
- linear program
- linear programming
- convex constraints
- approximation algorithms
- convex programming
- interior point algorithm
- linear programming problems
- quadratic programming
- interior point
- semidefinite programming
- inequality constraints
- objective function
- variational inequalities
- convex optimization problems
- convex relaxation
- semidefinite
- least squares
- optimal solution
- total variation
- low rank
- convex functions
- special case
- mixed integer
- dynamic programming
- learning algorithm
- convergence rate
- hyperplane
- denoising
- image processing