ESR12-Arefeh Kavand

This week, as my supervisor recommended, I started to read a paper by "Michael Zibulevsky" and "Leonid Mosheyev" on the "Penalty/Barrier Multiplier Algorithm for semidefinite programming." This paper aims to present a generalization of the penalty/Barrier multiplier (PBM) algorithm for SDPs also, a dual analysis of the method based on its correspondence to a proximal point algorithm with a nonquadratic distance-like function has been presented. Also, exploiting the duality of an SDP problem would be practical for many purposes. Therefore, we aim to develop a proper PBM-based algorithm for solving some specific SDP problems.  In general, the SDPS, which comes from polynomial optimization problems, has some difficulties, including the "size" of the problem and "conditioning." Hence some remedies like "CG Newton" for solving the Newton system and developing specific pre-conditioners will be considered. Mosheyev, L., & Michael

The 1st POEMA workshop in Florence from 15-17 January 2020 was planned to immerse the fresh ESR fellows into our research world, to work up new research ideas into firm plans, and to start weaving professional connections in our research area. Lectures by POEMA scientists and guests were delivered, accompanied by brainstorming challenges and problem sessions. In addition, much time was devoted to open discussions. The courses and talks on the first day of the workshop were "Tensors by Giorgio Ottaviani," "What is Polynomial Optimization by Simone Naldi," and "Decomposition of Tensors and Geometry by Luca Chiantini," In a nutshell, they were mostly about Algebraic concepts and introduction to tensor decomposition and tensor rank, from a geometric point of view, using geometric tools and methods to analyze properties of generic or specific tensors, both in general or in the symmetric case and also a general introduction to polynomial optimization, which is

Hello everyone, I am Arefeh (ESR12) my working title of the thesis is “On convex nonlinear semidefinite programming concepts for the solution of p olynomial optimization problems”. I am hosted by the Mathematical Optimization group in the Mathematics Department of the Friedrich-Alexander-University of Erlangen-Nuremberg. The team, led by Michael Stingl, has strong expertise in algorithmic optimization as well as optimization with (partial) differential equations. I am deeply honored that I would be a part of the POEMA from now on. In this weblog, I will be posting  articles describing my research life, my secondment or any topic related to my research in the POEMA. Today is the first day of my working at FAU. I am really really excited about this new chapter of my study life and I am also a little bit stressed out! I have met my supervisor and our team in the mathematics department. the senior researcher of the team, Dr. Fabian Wein, helped me a lot to learn some formalities a