Struct AlternatingProjectionSolver 

pub struct AlternatingProjectionSolver {
    pub max_iter: usize,
    pub tol: f64,
}

Alternating projection method (von Neumann / Dykstra variant) for finding a point in the intersection of two convex sets.

The sets are represented by their projection operators.

Fields

max_iter: usize

Maximum iterations.

tol: f64

Convergence tolerance on ‖x_{k+1} - x_k‖.

Implementations

impl AlternatingProjectionSolver

pub fn new(max_iter: usize, tol: f64) -> Self

Create a new solver.

pub fn run( &self, proj_a: impl Fn(&[f64]) -> Vec<f64>, proj_b: impl Fn(&[f64]) -> Vec<f64>, x0: &[f64], ) -> Vec<Vec<f64>>

Run alternating projections between two sets given by their projection functions. Returns the sequence of iterates.