Superiorization as an acceleration technique and beyond
Seminar
Speaker
Aviv Gibali (Holon Institute of Technology)
Date
12/01/2025 - 13:00 - 12:00Add to Calendar
2025-01-12 12:00:00
2025-01-12 13:00:00
Superiorization as an acceleration technique and beyond
The Superiorization Methodology (SM) can be thought of as lying conceptually between feasibility seeking and constrained minimization. It doesn't guarantee to find the optimum value of a given functional, rather it obtains a solution that is "superior" (with respect to the objective function) to what would be achieved if superiorization would not have been used (i.e., superior to a feasible solution).
In this talk I'll present some results in which we used superiorization and the bounded perturbation resilience of algorithms to speed up convergence of given algorithms in multi and single objective optimization problems. Moreover, show how this methodology can help for treating non-convex objective functions.
Math seminar room (building 216, room 201)
אוניברסיטת בר-אילן - Department of Mathematics
mathoffice@math.biu.ac.il
Asia/Jerusalem
public
Place
Math seminar room (building 216, room 201)
Abstract
The Superiorization Methodology (SM) can be thought of as lying conceptually between feasibility seeking and constrained minimization. It doesn't guarantee to find the optimum value of a given functional, rather it obtains a solution that is "superior" (with respect to the objective function) to what would be achieved if superiorization would not have been used (i.e., superior to a feasible solution).
In this talk I'll present some results in which we used superiorization and the bounded perturbation resilience of algorithms to speed up convergence of given algorithms in multi and single objective optimization problems. Moreover, show how this methodology can help for treating non-convex objective functions.
Last Updated Date : 06/01/2025
