Related papers: An Exact Continuous Conductance Formulation of the…
The first-order optimality conditions for a generic nonlinear optimization problem are generated as part of the terminal transversality conditions of an optimal control problem. It is shown that the Lagrangian of the optimization problem is…
We investigate a singular perturbation for Hamilton-Jacobi equations in an open subset of two dimensional Euclidean space, where the set is determined through a Hamiltonian function and the Hamilton-Jacobi equations are the dynamic…
A unitarily invariant projective framework is introduced to analyze the complexity of path-following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill-posedness, is given. A Newton map…
In this work we propose a method to perform optimization on manifolds. We assume to have an objective function $f$ defined on a manifold and think of it as the potential energy of a mechanical system. By adding a momentum-dependent kinetic…
Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz [Phys. Rev. A 67, 033407 (2003)], we define mechanism via pathways of…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
Optimal transportation provides a means of lifting distances between points on a geometric domain to distances between signals over the domain, expressed as probability distributions. On a graph, transportation problems can be used to…
We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\cal…
We briefly review a hamiltonian path integral formalism developed earlier by one of us. An important feature of this formalism is that the path integral quantization in arbitrary co-ordinates is set up making use of only classical…
We address the problem of optimal path planning for a simple nonholonomic vehicle in the presence of obstacles. Most current approaches are either split hierarchically into global path planning and local collision avoidance, or neglect some…
Given a graph $H$, let $G^j_k(H)$ be the graph whose vertices are the proper $k$-colorings of $H$, with edges joining two colorings if $H$ contains a connected subgraph on at most $j$ vertices that includes all vertices where the colorings…
The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…
Deciding if a graph is a Hamilton graph, also named the Hamilton cycle problem, is important for discrete mathematics and computer science. Due to no characterization to identify Hamilton graphs effectively, there are no tractable…
We consider a path-dependent Hamilton--Jacobi equation with coinvariant derivatives over the space of continuous functions. We prove two uniqueness results for viscosity (generalized) solutions defined in terms of coinvariantly smooth test…
The algebraic path problem provides a general setting for shortest path algorithms in optimization and computer science. This work extends the algebraic path problem to networks equipped with input and output boundaries. We show that the…
A method for solving zero-finding problems is developed by tracking homotopy paths, which define connecting channels between an auxiliary problem and the objective problem. Current algorithms' success highly relies on empirical knowledge,…
This thesis investigates optimal trajectory tracking of nonlinear dynamical systems with affine controls. The control task is to enforce the system state to follow a prescribed desired trajectory as closely as possible. The concept of…
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…
A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…
The Hamiltonian number of a connected graph is the minimum of the lengths of the closed, spanning walks in the graph. In 1968, Grinberg published a necessary condition for the existence of a Hamiltonian cycle in a planar graph, formulated…