A brief touch on term sparsity

Comments

Post a Comment

Popular posts from this blog

POEMA learning week 2: Day 2

Image
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. T...
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

A way to approximate the volume of semi algebraic sets using SDPs

Image
On Wednesday 30.01.2020 as part of a reading group I presented the work of: D. Henrion, J. B. Lasserre and C. Savorgnan on: Approximate Volume and Integration for Basic Semi-algebraic Sets. [ https://doi.org/10.1137/080730287 ] I wish to share some interesting bits of knowledge I came across. It is not my intention to fully and rigorously reproduce the contents of the above mentioned paper. Hence, if you are interested in the topic mentioned then please consult the paper. I was suggested this paper by Monique because it shows two things. The first being that finding the volume of a compact  basic semi-algebraic set K that is Archemedean (on the polynomials g_i defining  K), can be recast as a minimisation problem over measures (see Theorem 3.1). The  second thing that is shown is that this problem can be approximated by a hierarchy of SDP approximations that return the moments of a minimising measure. Both of these topics fall well within the scope of ...
Read more