A polymatroid approach to separable convex optimization with linear ascending constraints.
P. T. AkhilRahul SinghRajesh SundaresanPublished in: NCC (2014)
Keyphrases
- convex optimization
- convex constraints
- linear constraints
- interior point methods
- convex sets
- operator splitting
- low rank
- low rank matrix
- quadratic program
- total variation
- primal dual
- norm minimization
- semidefinite
- convex optimization problems
- semi infinite
- linear programming problems
- linear systems
- semidefinite program
- image restoration
- constrained optimization
- multiresolution
- convex formulation
- computer vision