A nonexpansive operator for computationally efficient hierarchical convex optimization.
Masao YamagishiIsao YamadaPublished in: APSIPA (2015)
Keyphrases
- convex optimization
- computationally efficient
- interior point methods
- low rank
- primal dual
- total variation
- convex optimization problems
- computational complexity
- semidefinite program
- convex sets
- convex relaxation
- operator splitting
- image segmentation
- convex formulation
- convex constraints
- norm minimization
- face recognition
- image sequences