splitFeas (version 0.1.0)

nmsfp_mmqn: MM algorithm (accelerated) for nonlinear multiple-sets split feasibility problem

Description

nmsfp_mmqn uses quasi-Newton updates to solve the nonlinear multiple-sets split feasibility problem.

Usage

nmsfp_mmqn(x0, v, w, plist1, plist2, f, df, h, hgrad, qn = 5, tol = 1e-10,
  max_iter = 1000)

Arguments

x0

Initial iterate

v

weights for first set of constraints

w

weights for second set of constraints

plist1

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

plist2

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

f

objective function

df

gradient of objective function

h

Function handle for output mapping

hgrad

Handle for output mapping Jacobian

qn

number of secants

tol

convergence tolerance

max_iter

maximum number of iterations

See Also

mmqn_step, qnamm