Related papers: A convex solution to Psiaki's first joint attitude…
We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local…
Euler proved that every rotation of a 3-dimensional body can be realized as a sequence of three rotations around two given axes. If we allow sequences of an arbitrary length, such a decomposition will not be unique. In this paper we solve…
The study of optimal control problems under uncertainty plays an important role in scientific numerical simulations. This class of optimization problems is strongly utilized in engineering, biology and finance. In this paper, a stochastic…
We develop a semiclassical theory for spin-dependent quantum transport to describe weak (anti)localization in quantum dots with spin-orbit coupling. This allows us to distinguish different types of spin relaxation in systems with chaotic,…
This paper investigates the attitude control problem of spacecraft, with the objective of achieving precise performance criteria including precise settling time, steady-state error, and overshoot elimination. To tackle this challenge, we…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
The hand-eye calibration problem is an important application problem in robot research. Based on the 2-norm of dual quaternion vectors, we propose a new dual quaternion optimization method for the hand-eye calibration problem. The dual…
In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…
There is currently much interest in the two-axis countertwisting spin squeezing Hamiltonian suggested originally by Kitagawa and Ueda, since it is useful for interferometry and metrology. No analytical solution valid for arbitrary spin…
The cubic regularization (CR) algorithm has attracted a lot of attentions in the literature in recent years. We propose a new reformulation of the cubic regularization subproblem. The reformulation is an unconstrained convex problem that…
A solar sail is one of the most promising space exploration system because of its theoretically infinite specific impulse using solar radiation pressure (SRP). Recently, some researchers proposed "transformable spacecrafts" that can…
Recently, Zhuang, Roth, \& Sudhakar [1] proposed a method that allows simultaneous computation of the rigid transformations from world frame to robot base frame and from hand frame to camera frame. Their method attempts to solve a…
Optimisation algorithms designed to work on quantum computers or other specialised hardware have been of research interest in recent years. Many of these solver can only optimise problems that are in binary and quadratic form. Quadratic…
We find an exact solution for the problem of electron spin relaxation in a 2D circle with Rashba spin-orbit interaction. Our analysis shows that the spin relaxation in finite-size regions involves three stages and is described by multiple…
This article considers nonconvex global optimization problems subject to uncertainties described by continuous random variables. Such problems arise in chemical process design, renewable energy systems, stochastic model predictive control,…
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…
Many nonconvex problems in robotics can be relaxed into convex formulations via Semi-Definite Programming (SDP) that can be solved to global optimality. The practical quality of these solutions, however, critically depends on rounding them…
In this paper, Kernel PCA is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is…
We consider the traffic control problem of dynamic routing over parallel servers, which arises in a variety of engineering systems such as transportation and data transmission. We propose a semi-gradient, on-policy algorithm that learns an…
The hand-eye measurements have recently been proven to be very efficient for spacecraft attitude determination relative to an ellipsoidal asteroid. However, recent method does not guarantee full attitude observability for all conditions.…