Primal-dual block-proximal splitting for a class of non-convex problems.
Stanislav MazurenkoJyrki JauhiainenTuomo ValkonenPublished in: CoRR (2019)
Keyphrases
- convex optimization problems
- primal dual
- convex optimization
- convex programming
- convex functions
- linear programming
- interior point methods
- semidefinite programming
- optimization problems
- saddle point
- linear programming problems
- linear program
- convex constraints
- convex hull
- variational inequalities
- convex relaxation
- np complete
- quasiconvex
- algorithm for linear programming
- affine scaling
- solving problems
- objective function
- simplex method
- semidefinite
- low rank
- convergence rate
- higher order
- interior point algorithm
- image processing