nmsfp_mm

weights for first set of constraints

weights for second set of constraints

list of projection functions for first set of constraints; each takes a single point and returns its projection

plist1

list of projection functions for second set of constraints; each takes a single point and returns its projection

plist2

Function handle for output mapping

Handle for output mapping Jacobian

hgrad

max_iter

<code>nmsfp_mm</code> uses quasi-Newton updates to solve the nonlinear multiple-sets split feasibility problem.

An implementation of the majorization-minimization (MM) algorithm introduced by
Xu, Chi, Yang, and Lange (2017) <arXiv:1612.05614> for solving multi-set split feasibility problems. In the multi-set split feasibility problem, we seek to find a point x
in the intersection of multiple closed sets and whose image under a mapping also must fall in the intersection of several closed sets.

nmsfp_mm: MM algorithm for nonlinear multiple-sets split feasibility problem

Description

Usage

Arguments

See Also