2 papers
math.OC2025
A necessary condition for the guarantee of the superiorization method
Kay Barshad, Yair Censor, Walaa Moursi +2
We study a method that involves principally convex feasibility-seeking and makes secondary efforts of objective function value reduction. This is the well-known superiorization met…
math.OC2022
Regularized Nonsmooth Newton Algorithms for Best Approximation
Yair Censor, Walaa M. Moursi, Tyler Weames +1
We consider the problem of finding the best approximation point from a polyhedral set, and its applications, in particular to solving large-scale linear programs. The classical pro…