Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints.
Hideaki IidukaPublished in: J. Comput. Appl. Math. (2015)
Keyphrases
- convex optimization
- point sets
- allocation problems
- point pattern matching
- resource allocation
- point correspondences
- interior point methods
- low rank
- primal dual
- total variation
- metric space
- distance function
- convex optimization problems
- convex relaxation
- pairwise
- point set registration
- similarity search
- face recognition
- feature selection