<< CCA (Computational Convex Analysis) | CCA (Computational Convex Analysis) | _pl_fusion >>

CCA (Computational Convex Analysis) >> CCA (Computational Convex Analysis) > _pl_kaFeasiblePoint

# _pl_kaFeasiblePoint

Convex operators via optimization (OPT), Kernel average feasible point

### Calling Sequence

    y1 = _pl_kaFeasiblePoint(xstart, x, lambda1, lambda2, domf1, domf2, domg)

### Parameters

xstart, x

  real numbers.

lambda1, lambda2

  real numbers satisfying lambda1+lambda2=1 and lambda1,lambda2>=0.

domf1, domf2, domg

  Intervals of the form I=[lb,ub] storing sets of points where the respective functions are finite.

y1

  Real number for which the function in the Description is finite (or %nan if such a number does not exist).

### Description

Computes a feasible point, i.e. a point for which the function

    lambda1 f1(y1) + lambda2 f2(y2) + lambda1 lambda2 g(y1-y2)

is finite.

### Authors

- Yves Lucet, University of British Columbia, BC, Canada
- Bryan Gardiner, University of British Columbia, BC, Canada

<< CCA (Computational Convex Analysis) | CCA (Computational Convex Analysis) | _pl_fusion >>