2 citations · 2 across the 1 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2024
Sparse convex relaxations in polynomial optimization
Gennadiy Averkov, Benjamin Peters, Sebastian Sager
We present a novel, general, and unifying point of view on sparse approaches to polynomial optimization. Solving polynomial optimization problems to global optimality is a ubiquito…
math.OC2024
Refined TSSOS
Daria Shaydurova, Volker Kaibel, Sebastian Sager
The moment-sum of squares hierarchy by Lasserre has become an established technique for solving polynomial optimization problems. It provides a monotonically increasing series of t…
math.OC2016★ 2 cited
Synthesis of optimal controls and numerical optimization for the vibration-based energy harvesters
Thuy T. T. Le, Binh D. Truong, Felix Jost +3
This work is devoted to demonstration of the analysis on optimizing the output power harvested from vibration energy harvester.