An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping.
Habtu ZegeyeNaseer ShahzadPublished in: Appl. Math. Comput. (2014)
Keyphrases
- point sets
- convex hull
- optimal solution
- boundary points
- variational inequalities
- traffic assignment
- objective function
- np hard
- learning algorithm
- closed form
- dynamic programming
- worst case
- linear programming
- expectation maximization
- variational inequality problems
- boundary value problem
- convex sets
- energy function
- graph cuts
- multi view