POEMA learning week 2: Day 2

Today was a full day. Starting with a triple whammy of POEMA ESR talks we got off to a running start. I will try my best to recall the highlights (based on my own limited understanding and memory) of the day:

ESR2 Andrew : Attacking polynomial optimization problems via the critical values route. This means computing the Jacobian of the system and then solving a determental system using a very subject specific algorithm Sparse FGLM algorithm.

ESR4 Alejandro : A verbose intro into real zero (RZ) polynomials from theory down to numerics. I had hoped to see a clearer link between RZ polynomials and the Generalized Lax Conjecture but hey-ho.

ESR12 Arefeh : Leveraging both primal and dual formulations in solving SDP's. Also extensions to sparse large SDP's and preconditioners for low rank SDPs. Considering how much I rely on SDP solvers I am painfully unaware of all the intricacies of their operation. I am glad Arefeh is an expert I can refer to should the need arise.

Prof. Dr. Thorsten Theobald gave a thorough intro to relative entropy programming. The gist was that one considers signomials instead of polynomials,( a polynomial with the monomials swapped out for exponentials). Optimization becomes a question of non negativity and this question is addressed by the arithmetic mean geometric mean inequality in contradistinction to the SOS approach from polynomial optimization.

There is a lot to digest, hopefully tomorrows soft skills training will be a change of pace.

Comments

Post a Comment

Popular posts from this blog

Purpose of this blog: To log my mathematical endeavours.

Why does this blog exist? I am required to maintain a blog of my research activities as mandated by my contract with POEMA. Secondly this blog will serve as record for evaluating my progress (both for me and my superiors) as well as a platform to showcase my interests (to possible collaborators). Thirdly, it serve as a source of information to anyone interested in me or the topics I study. I must warn the reader that I am a novice to the practice of blogging. Hence, constructive criticism is welcomed. What is the content of this blog? In this blog I will record my mathematical endeavours, indexed by the week in which they take place. The mathematical endeavours are directed towards the topic of :  Approximation hierarchies for (non-)commutative polynomial optimisation. This topic falls under general polynomial optimisation techniques and is know to use tools from (but not limited to): real algebra moment theory operator theory semidefinite optimisation. In addition ...
Read more

Some Julia Language resources

Image
blog-post Some Julia Language resources. Lately I have been preoccupied with computing lower bounds for the completely positive matrix factorization rank of a suitable matrix A. Though, this post is not about the mathematics of this topic rather than the software that I am using, namely Julia Language. To quote from Wikipedia : Julia is a high-level, high-performance, dynamic programming language. While it is a general-purpose language and can be used to write any application, many of its features are well suited for numerical analysis and computational science. It is my hope that in this post I can share some of the resources and study material that I found and thereby save the reader time and effort in learning Julia Language. I am by no means an expert in this topic but the links I provide should help the reader find his/her way to experts. Some notes: Julia is fast, click here to see how the ...
Read more