POEMA 1st Workshop 15-17 Jan (Florence)

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 the problem of minimizing polynomial functions over semi-algebraic sets. 
As POEMA is a teamwork project, every single ESRs must know what others will do. Although for a person like me who has been studying applied mathematics for years, these algebraic concepts were hard to absorb, thanks to the lecturers and other ESRs who was expert in such these fields, discussing together during the breaks and exercises sessions, I could also understand the topics and the concepts.
Among all of the advantages of POEMA, the best one is to involve passionate young researchers from different nationalities and with different ideas and different ways of thinking, so these features make POEMA great because in our free discussions when we were talking about different branches of mathematics, we learned a lot from each other. It was great to know others' ideas and their scientific backgrounds because all of these would be very helpful in this research journey since we are a family "POEMA," and our goal is the same.😊✌



Comments

Post a Comment

Popular posts from this blog

Summary of my research's theoretical part

Image
During the last year of my study, we have been exploring the convergence analysis of the developed algorithm (PBM-AL) . We developed a dual convergence analysis for the penalty barrier multiplier augmented Lagrangian (PBM-AL) method using a hyperbolic penalty function. Our analysis showed that PBM-AL can be characterized as a proximal point algorithm based on Fenchel conjugates. This allows for a more efficient scheme without sacrificing convergence results. Notably, our analysis relaxes the assumption of exact subproblem solutions, introducing an early stopping condition based on Fenchel duality. We also proposed a primal-dual update scheme ( PDAL ) to ensure dually feasible iterates and allowed controlled violation of equality constraints for the use of iterative solvers. A relaxation of Fenchel duality using an exact penalty function was utilized for the early stopping criterion. Below are the key literature sources that were utilized for the analysis and derivation of the conve...
Read more

POEMA Final Workshop

Image
 From September 5th to 9th, 2022, the final POEMA workshop was held in the romantic city of Paris😍. The Sorbonne University Pierre and Marie Curie Campus provided a fitting location for this open international conference on Polynomial Optimization, which aimed to disseminate the network's results. Almost all ESRs planned to present their final results, making it exciting and significant to see everyone from the project in person again. The daily presentations were informative, providing opportunities to connect with other researchers and expand our network. We had many friendly conversations with the other ESRs, discussing our challenges and life😊. On September 7th, I was pleased to present " A Primal-Dual Augmented Lagrangian Method for the solution of Convex Semidefinite Programming Problems ." The feedback and questions I received were invaluable, allowing me to delve deeper into certain parts of my results. ( The YouTube link of my presentation ). On September 8th,...
Read more

First day of working

Image
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 formaliti...
Read more