Accessible text below the picture
A virtual workshop on Optimization and Operator Theory
dedicated to Professor Lev Bregman on the occasion of his 80th birthday
November 15-17, 2021
This research workshop is devoted to various themes, results and open problems regarding optimization, operator theory and their diverse applications.
It will bring together a select group of experts from all over the world.
For more details, please contact the organizers: Aviv Gibali (), Simeon Reich (sreich@technion.ac.il) and Alexander Zaslavski (ajzasl@technion.ac.il)
Program
November 15
9:00 – 9:30
Regina Burachik (University of South Australia) – Generalized Bregman distances
9:30 – 10:00
Yair Censor (University of Haifa)- The Superiorization Methodology
10:10 – 10:40
Shoham Sabach (The Technion – Israel Institute of Technology) – First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
10:40 – 11:10
Daniel Wachsmuth (University of Wuerzburg) – Proximal gradient methods for control problems with non-smooth and non-convex control cost
11:30 – 12:00
Christian Günther (Martin Luther University Halle-Wittenberg) – Vector optimization w.r.t. relatively solid convex cones in real linear spaces
12:00 – 12:30
Elena Resmerita (Alpen-Adria University of Klagenfurt) – On certain variational non-additive noise models and beyond
12:40 – 13:10
Constantin Zalinescu (Octav Mayer Institute of Mathematics) – On lagrange multipliers in convex entropy minimization
15:30 – 16:00
Igor Griva (George Mason University) – To rescale or to project? Solving quadratic programing problems with Lagrange multipliers methods
16:00-16:30
Angelia Nedich (Arizona State University) – Inexact smoth penalty for convex problems with linear constraint
16:40 – 17:10
Jong-Shi Pang (University of Southern California) – Some Nonsmooth Function Classes and Their Optimization
November 16
9:00 – 9:30
Hong-Kun Xu (Hangzhou Dianzi University) – Halpern’s iteration method for monvex-moncave minimax Problems
9:30 – 10:00
Chinedu Izuchukwu (The Technion – IIT) (TBA)
10:10 – 10:40
Adir Pridor (Holon Institute of Technology) – “Hopeless” optimization in industrial mathematics
10:40 – 11:10
Michel Thera ( Université de Limoges) – Characterizing the error bound properties of functions in metrizable topological vector spaces
11:30 – 12:00
Christiane Tammer (Martin-Luther-University Halle-Wittenberg) – Vector optimization with respect to variable domination structures
12:00 – 12:30
Roman Polyak (George Mason University) – Finding non-Linear production-consumption equilibrium
15:30 – 16:00
Boris Mordukhovich (Wayne State University) – Generalized newton methods via variational analysis
16:00 – 16:30
Panos Pardalos (University of Florida) – On the limits of computation in non-convex optimization
16:40 – 17:10
Terry Rockafellar (University of Florida) – Local monotonicity of subgradient mapping
November 17
9:00 – 9:30
Isao Yamada (Tokyo Institute of Technology) – A constrained ligme model for sparsity-rank-aware least-squares estimation problems
9:30 – 10:00
Gershon Wolansky (The Technion – IIT) (TBA)
10:10 – 10:40
Stefania Petra (Heidelberg University) – A geometric first-order multilevel method for discrete tomography
10:40 – 11:10
Alexander Zaslavski (The Technion – IIT) – Optimization on solution sets of common fixed point problems
11:30 – 12:00
Amir Beck (Tel Aviv University) (TBA)
12:00 – 12:30
Marc Teboulle (Tel Aviv University) – The bregman proximal optimization framework illustrated
15:30 – 16:00
Patrick Louis Combettes (North Carolina State University) – Warped resolvent iterations
16:00 – 16:30
Akhtar Khan (Rochester Institute of Technology) – An optimization framework for the nonlinear inverse problems of elastimating random parameters in stochastic pdes
16:40 – 17:10
Shawn Wang (University of British Columbia) – Bregman proximal averages no restrictions