The Computer Science Colloquium
Thursday, March 4, 4:15pm, room 9204/05
"Perturbation Resilience and the Superior Feasible Solution "
Superiorization is envisioned as lying between the methods of optimization
and of feasibility seeking. Generally speaking, optimization is a
computationally more demanding task than that of finding
just any feasible point. We propose that, without employing an
optimization algorithm, it is possible to use certain iterative methods,
designed for (the less demanding) feasibility problems, in a way that will
steer the iterates toward a point that is superior, but not necessarily
optimal, in a well-defined sense. The possibility to do so stems from the
perturbation resilience (stability) of the feasibility seeking methods.
This is joint work with Ran Davidi and Gabor T. Herman.
The Colloquium is supported by generous contributions from
the Bloomberg, Information Builders, Inc., and Netlogic,
Inc.
365 Fifth Ave, New York City 10016 | Room 4319 | Phone: 212.817.8190 | Fax: 212.817.1510 | compsci@gc.cuny.edu


