Related papers: Critical Topology for Optimization on the Symplect…
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover, a type of integer programming (IP) problem. A lattice-gas model on the Erd\"os-R\'enyi random graphs of $\alpha$-uniform…
The automorphism group of an elliptic curve over an algebraically closed field is well known. However, for various applications in coding theory and cryptography, we usually need to apply automorphisms defined over a finite field. Although…
The optimization problem of the minimum set of leaders for the controllability of undirected graphs are addressed. It is difficult to find not only its optimal solution but also its approximate algorithm. We propose a new concept, namely…
The problem of computing the global minimum of a trigonometric polynomial is computationally hard. We address this problem for the case, where the polynomial is invariant under the exponential action of a finite group. The strategy is to…
In this paper, we give explicit descriptions of versions of (Local-) Backtracking Gradient Descent and New Q-Newton's method to the Riemannian setting.Here are some easy to state consequences of results in this paper, where X is a general…
The least squares problem is formulated in terms of Lp quasi-norm regularization (0<p<1). Two formulations are considered: (i) an Lp-constrained optimization and (ii) an Lp-penalized (unconstrained) optimization. Due to the nonconvexity of…
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…
Riemannian optimization is concerned with problems, where the independent variable lies on a smooth manifold. There is a number of problems from numerical linear algebra that fall into this category, where the manifold is usually specified…
The problem of finding suitable point embedding or geometric configurations given only Euclidean distance information of point pairs arises both as a core task and as a sub-problem in a variety of machine learning applications. In this…
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
This article considers a discrete-time robust optimal control problem on matrix Lie groups. The underlying system is assumed to be perturbed by exogenous unmeasured bounded disturbances, and the control problem is posed as a min-max optimal…
Symplectic integration of autonomous Hamiltonian systems is a well-known field of study in geometric numerical integration, but for non-autonomous systems the situation is less clear, since symplectic structure requires an even number of…
A tracking type optimal control problem for a nonlinear and nonlocal kinetic Fokker-Planck equation which arises as the mean field limit of an interacting particle systems that is subject to distance dependent random fluctuations is…
We address the problem of finding the nearest graph Laplacian to a given matrix, with the distance measured using the Frobenius norm. Specifically, for the directed graph Laplacian, we propose two novel algorithms by reformulating the…
A solution to the left-invariant sub-Riemannian problem on the group of motions (rototranslations) of a plane SE(2) is obtained. Local and global optimality of extremal trajectories is characterized. Lower and upper bounds on the first…
We investigate the minimization of a quadratic function over Stiefel manifolds (the set of all orthogonal $r$- frames in $\mathbf{R}^n$), which has applications in high-dimensional semi-supervised classification tasks. To reduce the…
We provide characterizations of Lie groups as compact-like groups in which all closed zero-dimensional metric (compact) subgroups are discrete. The "compact-like" properties we consider include (local) compactness, (local)…
We show that for n>=3 the symplectic group Sp(n) is as a 2-compact group determined up to isomorphism by the isomorphism type of its maximal torus normalizer. This allows us to determine the integral homotopy type of Sp(n) among connected…
We consider several questions about restriction of representations of classical and metaplectic groups over local and global fields to subgroups, extending considerably the scope of the earlier work on $SO(n),SO(n-1)$. This includes Bessel…