A fundamental challenge in learning an unknown dynamical system is to re...
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials t...
A fundamental challenge in learning to control an unknown dynamical syst...
We present a mathematical and computational framework for the problem of...
We consider the notions of (i) critical points, (ii) second-order points...
We show that unless P=NP, there cannot be a polynomial-time algorithm th...
Historically, scalability has been a major challenge to the successful
a...
We study time-varying semidefinite programs (TV-SDPs), which are semidef...
It has recently been shown that the problem of testing global convexity ...
A robust-to-dynamics optimization (RDO) problem is an optimization probl...
We prove that unless P=NP, there exists no polynomial time (or even
pseu...
In a recent note [8], the author provides a counterexample to the global...
In recent years, techniques based on convex optimization and real algebr...
In recent years, optimization theory has been greatly impacted by the ad...
Motivated by applications in robotics and computer vision, we study prob...
We consider the problem of decomposing a multivariate polynomial as the
...