Recent scalability improvements for semidefinite programming with applications in machine learning, control, and robotics

A Majumdar, G Hall, AA Ahmadi - Annual Review of Control …, 2020 - annualreviews.org
Historically, scalability has been a major challenge for the successful application of
semidefinite programming in fields such as machine learning, control, and robotics. In this …

A survey on conic relaxations of optimal power flow problem

F Zohrizadeh, C Josz, M Jin, R Madani, J Lavaei… - European journal of …, 2020 - Elsevier
Conic optimization has recently emerged as a powerful tool for designing tractable and
guaranteed algorithms for power system operation. On the one hand, tractability is crucial …

Semidefinite relaxations for certifying robustness to adversarial examples

A Raghunathan, J Steinhardt… - Advances in neural …, 2018 - proceedings.neurips.cc
Despite their impressive performance on diverse tasks, neural networks fail catastrophically
in the presence of adversarial inputs—imperceptibly but adversarially perturbed versions of …

A survey of relaxations and approximations of the power flow equations

DK Molzahn, IA Hiskens - Foundations and Trends® in …, 2019 - nowpublishers.com
The power flow equations relate the power injections and voltages in an electric power
system and are therefore key to many power system optimization and control problems …

Funnel libraries for real-time robust feedback motion planning

A Majumdar, R Tedrake - The International Journal of …, 2017 - journals.sagepub.com
We consider the problem of generating motion plans for a robot that are guaranteed to
succeed despite uncertainty in the environment, parametric model uncertainty, and …

DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization

AA Ahmadi, A Majumdar - SIAM Journal on Applied Algebra and Geometry, 2019 - SIAM
In recent years, optimization theory has been greatly impacted by the advent of sum of
squares (SOS) optimization. The reliance of this technique on large-scale semidefinite …

Data-driven stabilization of nonlinear polynomial systems with noisy data

M Guo, C De Persis, P Tesi - IEEE Transactions on Automatic …, 2021 - ieeexplore.ieee.org
In a recent article, we have shown how to learn controllers for unknown linear systems using
finite-length noisy data by solving linear matrix inequalities. In this article, we extend this …

TSSOS: A moment-SOS hierarchy that exploits term sparsity

J Wang, V Magron, JB Lasserre - SIAM Journal on optimization, 2021 - SIAM
This paper is concerned with polynomial optimization problems. We show how to exploit
term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of …

CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization

J Wang, V Magron, JB Lasserre, NHA Mai - ACM Transactions on …, 2022 - dl.acm.org
This work proposes a new moment-SOS hierarchy, called CS-TSSOS, for solving large-
scale sparse polynomial optimization problems. Its novelty is to exploit simultaneously …

Shape-constrained symbolic regression—improving extrapolation with prior knowledge

G Kronberger, FO de França, B Burlacu… - Evolutionary …, 2022 - direct.mit.edu
We investigate the addition of constraints on the function image and its derivatives for the
incorporation of prior knowledge in symbolic regression. The approach is called shape …