Yair Censor

Bio-sketch and research interests appear at: http://math.haifa.ac.il/YAIR/censor-interests.html

General Perturbation Resilient Dynamic String-Averaging for Inconsistent Problems with Superiorization

  • Kay Barshad
  • Yair Censor
    • Categories Constrained Nonlinear Optimization, Convex Optimization Tags , , , , , , , , , , , , , , ,

    In this paper we introduce a General Dynamic String-Averaging (GDSA) iterative scheme and investigate its convergence properties in the inconsistent case, that is, when the input operators don’t have a common fixed point. The Dynamic String-Averaging Projection (DSAP) algorithm itself was introduced in an 2013 paper, where its strong convergence and bounded perturbation resilience were … Read more

    Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography

  • Yair Censor
    • Categories Applications - Science and Engineering, Constrained Nonlinear Optimization Tags , , ,

    This document presents a (mostly) chronologically-ordered bibliography of scientific publications on the superiorization methodology and perturbation resilience of algorithms which is compiled and continuously updated by us at: http://math.haifa.ac.il/yair/bib-superiorization-censor.html. Since the beginnings of this topic we try to trace the work that has been published about it since its inception. To the best of our … Read more

    An iterative process for the feasibility-seeking problem with sets that are unions of convex sets

  • Yair Censor
  • Alexander J. Zaslavski
    • Categories Constrained Nonlinear Optimization, Convex Optimization Tags , , , ,

    In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem stems from the fact that it was recently discovered to serve as a modeling approach in fields of applications and from the ongoing recent research efforts … Read more

    A necessary condition for the guarantee of the superiorization method

  • Kay Barshad
  • Yair Censor
  • Walaa M. Moursi
  • Tyler Weames
  • Henry Wolkowicz
    • Categories Biomedical Applications, Constrained Nonlinear Optimization, Convex Optimization Tags , , , , ,

    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 method (SM), where the iterates of an asymptotically convergent iterative feasibility-seeking algorithm are perturbed by objective function nonascent steps. We investigate the question under what conditions a sequence generated by an SM … Read more

    New results related to cutters and to an extrapolated block-iterative method for finding a common fixed point of a collection of them

  • Yair Censor
  • Daniel Reem
  • Maroun Zaknoon
    • Categories Convex Optimization, Nonlinear Optimization, Parallel Algorithms Tags , , , ,

    Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators.  Instances of the problem have numerous applications in science and engineering. We consider an extrapolated block-iterative method with dynamic … Read more

    Immunity to Increasing Condition Numbers of Linear Superiorization versus Linear Programming

  • Jan Schröder
  • Yair Censor
  • Philipp Süss
  • Karl-Heinz Küfer
    • Categories Basic Sciences Applications, Constrained Nonlinear Optimization, Linear Programming Tags , , , , , , ,

    Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at finding a point that fulfills the constraints and has the minimal value of the objective function … Read more

    Floorplanning with I/O assignment via feasibility-seeking and superiorization methods

  • ShanYu
  • Yair Censor
  • Guojie Luo
    • Categories Applications - Science and Engineering, Constrained Nonlinear Optimization, VLSI layout Tags , , , , , ,

    The feasibility-seeking approach offers a systematic framework for managing and resolving intricate constraints in continuous problems, making it a promising avenue to explore in the context of floorplanning problems with increasingly heterogeneous constraints. The classic legality constraints can be expressed as the union of convex sets. However, conventional projection-based algorithms for feasibility-seeking do not guarantee … Read more

    Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy

  • Francisco J. Aragón Artacho
  • Weiwei Cai
  • Yair Censor
  • Aviv Gibali
  • Chongyuan Shui
  • David Torregrosa-Belén
    • Categories Biomedical Applications, Constrained Nonlinear Optimization, Nonsmooth Optimization Tags , , , , , ,

    In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption spectroscopy, which is a highly-nonlinear problem with variables coupling, we consider a situation where straightforward translation to a fixed point problem is not possible because the operators that represent the … Read more

    The best approximation pair problem relative to two subsets in a normed space

  • Daniel Reem
  • Yair Censor
    • Categories Convex and Nonsmooth Optimization, Global Optimization, Infinite Dimensional Optimization Tags , , , , , , , , ,

    In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset, which realizes the distance between the subsets. This problem, which has a long history, has … Read more

    Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment

  • ShanYu
  • Yair Censor
  • Ming Jiang
  • Guojie Luo
    • Categories Applications - Science and Engineering, Constrained Nonlinear Optimization, VLSI layout Tags , , , ,

    The feasibility-seeking approach provides a systematic scheme to manage and solve complex constraints for continuous problems, and we explore it for the floorplanning problems with increasingly heterogeneous constraints. The classic legality constraints can be formulated as the union of convex sets. However, the convergence of conventional projection-based algorithms is not guaranteed when the constraints sets … Read more