Login / Signup

A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework.

Mikhail V. Solodov
Published in: Optim. Methods Softw. (2004)
Keyphrases
  • convex optimization
  • decomposition methods
  • convex optimization problems
  • low rank
  • image processing
  • optical flow
  • image segmentation
  • constraint satisfaction problems
  • primal dual