VA & Opt Webinar: Lyudmila Polyakova

Title: Smooth approximations of D.C. functions

Speaker: Lyudmila Polyakova (Saint-Petersburg State University)

Date and Time: May 5th, 2021, 17:00 AEST (Register here for remote connection via Zoom)

Abstract: An investigation of properties of difference of convex functions is based on the basic facts and theorems of convex analysis, as the class of convex functions is one of the most investigated among nonsmooth functions. For an arbitrary convex function a family of continuously differentiable approximations is constructed using the infimal convolution operation. If the domain of the considered function is compact then such smooth convex approximations are uniform in the Chebyshev metric. Using this technique a smooth approximation is constructed for the d.c. functions. The optimization properties of these approximations are studied.

VA & Opt Webinar: Jiri Outrata

Title: On the solution of static contact problems with Coulomb friction via the semismooth* Newton method

Speaker: Jiri Outrata (Institute of Information Theory and Automation of the Czech Academy of Sciences)

Date and Time: April 28th, 2021, 17:00 AEST (Register here for remote connection via Zoom)

Abstract: The lecture deals with application of a new Newton-type method to the numerical solution of discrete 3D contact problems with Coulomb friction. This method suits well to the solution of inclusions and the resulting conceptual algorithm exhibits, under appropriate conditions, the local superlinear convergence. After a description of the method a new model for the considered contact problem, amenable to the application of the new method, will be presented. The second part of the talk is then devoted to an efficient implementation of the general algorithm and to numerical tests. Throughout the whole lecture, various tools of modern variational analysis will be employed.

Postdoc position and PhD position: Optimization for Machine Learning (Linköping Univ)

Postdoc position Optimization for Machine Learning (Linköping Univ)
The department of Mathematics at Linkoping University seeks applications for a Postdoc position in the area of mathematical optimization theory with the aim of developing new techniques for machine learning. The position is for 2 years.

The doctoral student will be supervised by Dr. Oleg Burdakov and Dr. Yura Malitsky  

The application deadline is May 21, 2021.  

The full job ad: https://liu.se/en/work-at-liu/vacancies?rmpage=job&rmjob=16145&rmlang=UK

PhD student in Optimization for Machine Learning (Linköping Univ)
The department of Mathematics at Linkoping University seeks applications for a PhD student position in the area of mathematical optimization theory with the aim of developing new techniques for machine learning. The position is for 4 years without teaching or 5 years with teaching. 

The doctoral student will be supervised by Dr. Oleg Burdakov and
Dr. Yura Malitsky 

The application deadline is May 7, 2021. 

VA & Opt Webinar: Ewa Bednarczuk

Title: On duality for nonconvex minimization problems within the framework of abstract convexity

Speaker: Ewa Bednarczuk (Warsaw University of Technology and Systems Research Institute of the PAS)

Date and Time: April 21st, 2021, 17:00 AEST (Register here for remote connection via Zoom)

VA & Opt Webinar: Roger Behling

Title: Circumcentering projection type methods

Speaker: Roger Behling (Fundação Getúlio Vargas)

Date and Time: April 14th, 2021, 11:00 AEST (Register here for remote connection via Zoom)

Abstract: Enforcing successive projections, averaging the composition of reflections and barycentering projections are settled techniques for solving convex feasibility problems. These schemes are called the method of alternating projections (MAP), the Douglas-Rachfort method (DRM) and the Cimmino method (CimM), respectively. Recently, we have developed the circumcentered-reflection method (CRM), whose iterations employ generalized circumcenters that are able to accelerate the aforementioned classical approaches both theoretically and numerically. In this talk, the main results on CRM are presented and a glimpse on future work will be provided as well.

VA & Opt Webinar: Russell Luke

Title: Inconsistent Stochastic Feasibility: the Case of Stochastic Tomography

Speaker: Russell Luke (University of Göttingen)

Date and Time: April 7th, 2021, 17:00 AEST (Register here for remote connection via Zoom)

In an X-FEL experiment, high-energy x-ray pulses are shot with high repetition rates on a stream of identical single biomolecules and the scattered photons are recorded on a pixelized detector. These experiments provide a new and unique route to macromolecular structure determination at room temperature, without the need for crystallization, and at low material usage. The main challenges in these experiments are the extremely low signal-to-noise ratio due to the very low expected photon count per scattering image (10-50) and the unknown orientation of the molecules in each scattering image.

Mathematically, this is a stochastic computed tomography problem where the goal is to reconstruct a three-dimensional object from noisy two-dimensional images of a nonlinear mapping whose orientation relative to the object is both random and unobservable. The idea is to develop of a two-step procedure for solving this problem. In the first step, we numerically compute a probability distribution associated with the observed patterns (taken together) as the stationary measure of a Markov chain whose generator is constructed from the individual observations. Correlation in the data and other a priori information is used to further constrain the problem and accelerate convergence to a stationary measure. With the stationary measure in hand, the second step involves solving a phase retrieval problem for the mean electron density relative to a fixed reference orientation.

The focus of this talk is conceptual, and involves re-envisioning projection algorithms as Markov chains. We already present some new routes to “old” results, and a fundamental new approach to understanding and accounting for numerical computation on conventional computers.