Incremental subgradient method for nonsmooth convex optimization with fixed point constraints.
Hideaki IidukaPublished in: Optim. Methods Softw. (2016)
Keyphrases
- fixed point
- convex optimization
- variational inequalities
- convex sets
- interior point methods
- primal dual
- sufficient conditions
- convex optimization problems
- linear programming problems
- total variation
- augmented lagrangian
- image segmentation
- convex programming
- convex relaxation
- constrained optimization
- constraint programming
- dynamical systems
- linear constraints
- linear programming
- image processing