Related papers: Solving the $KP$ problem with the Global Cartan De…
We present an extension of K-P time-optimal quantum control solutions using global Cartan $KAK$ decompositions for geodesic-based solutions. Extending recent time-optimal constant-$\theta$ control results, we integrate Cartan methods into…
The goal of this paper is to describe a method to solve a class of time optimal control problems which are equivalent to finding the sub-Riemannian minimizing geodesics on a manifold M. In particular, we assume that the manifold M is acted…
The problem of finding minimizing geodesics for a manifold M with a sub-Riemannian structure is equivalent to the time optimal control of a driftless system on M with a bound on the control. We consider here a class of sub-Riemannian…
We introduce a systematic method to solve a type of Cartan's realization problem. Our method builds upon a new theory of Lie algebroids and Lie groupoids with structure group and connection. This approach allows to find local as well as…
We explicitly compute the optimal cost for a class of example problems in geometric quantum control. These problems are defined by a Cartan decomposition of $su(2^n)$ into orthogonal subspaces $\mathfrak{l}$ and $\mathfrak{p}$ such that…
If $G$ is a connected semisimple Lie group with finite center and $K$ is a maximal compact subgroup of G, then the Lie algebra of $G$ admits a Cartan decomposition $\mathfrak{g}=\mathfrak{k}\oplus\mathfrak{p}$. This allows us to define the…
We study the time optimal control problem for the evolution operator of an n-level quantum system from the identity to any desired final condition. For the considered class of quantum systems the control couples all the energy levels to a…
When $G$ is a complex reductive algebraic group and $G/K$ is a reductive symmetric space, the decomposition of $\C[G/K]$ as a $K$-module was obtained (in a non-constructive way) by Richardson, generalizing the celebrated result of…
We present a temporal decomposition scheme for solving long-horizon optimal control problems. In the proposed scheme, the time domain is decomposed into a set of subdomains with partially overlapping regions. Subproblems associated with the…
In this paper, we study some control problems that derive from time optimal control of coupled spin dynamics in NMR spectroscopy and quantum information and computation. Time optimal control helps to minimize relaxation losses. The ability…
Let $G$ be a linear connected non-compact real simple Lie group and let $K\subset G$ be a maximal compact subgroup of $G$. Suppose that the centre of $K$ isomorphic to $\mathbb{S}^1$ so that $G/K$ is a global Hermitian symmetric space. Let…
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…
A method is presented for the numerical solution of optimal boundary control problems governed by parabolic partial differential equations. The continuous space-time optimal control problem is transcribed into a sparse nonlinear programming…
A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an…
The purpose of this work is the development of space-time discretization schemes for phase-field optimal control problems. Specifically in the optimal control minimization problem, a tracking-type cost functional is minimized to steer the…
We present new Neumann-Neumann algorithms based on a time domain decomposition applied to unconstrained parabolic optimal control problems. After a spatial semi-discretization, the Lagrange multiplier approach provides a coupled…
Given a symmetric triple $(G,K,\sigma)$ of compact type, with $G^{\sigma} = K$, the well known Cartan embedding $\hat{\Phi}: G/K \to G$ homothetically embeds the symmetric space $M = G/K$ as a totally geodesic submanifold of $G$. In this…
Graphon control has been proposed and developed in [1]-[3] to approximately solve control problems for very large-scale networks (VLSNs) of linear dynamical systems based on graphon limits. This paper provides a solution method based on…
This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…
In this paper, our goal is to study fundamental foundations of linear quadratic Gaussian (LQG) control problems for stochastic linear time-invariant systems via Lagrangian duality of semidefinite programming (SDP) problems. In particular,…