Related papers: Hohmann Transfer via Constrained Optimization
This paper presents a new method for solving a class of nonlinear optimal control problems with a quadratic performance index. In this method, first the original optimal control problem is transformed into a nonlinear two-point boundary…
Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms. In this paper, we use…
Optimal Transport (OT) problems arise in a wide range of applications, from physics to economics. Getting numerical approximate solution of these problems is a challenging issue of practical importance. In this work, we investigate the…
This article solves an optimal control problem arising in attitude control of a spacecraft under state and control constraints. We first derive the discrete-time attitude dynamics by employing discrete mechanics. The orientation transfer,…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
This work investigates the finite-horizon optimal covariance steering problem for discrete-time linear systems subject to both additive and multiplicative uncertainties as well as state and input chance constraints. In particular, a…
We study the Bergman determinantal point process from a theoretical point of view motivated by its simulation. We construct restricted and restricted-truncated variants of the Bergman kernel and show optimal transport inequalities involving…
This paper introduces a new optimization model that integrates the multi-port stowage planning problem with the container relocation problem. This problem is formulated as a binary mathematical programming model that must find the…
This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean $\ell_2$-norm. It offers theoretical guarantees regarding the iteration complexities of the Sinkhorn--Knopp algorithm, Accelerated Gradient…
In this paper, we present an interior point algorithm with a full-Newton step for solving a linearly constrained convex optimization problem, in which we propose a generalization of the work of Kheirfam and Nasrollahi…
In this paper we describe optimal reduction for the system of two bodies in $\mathbb{R}^3$ whose Hamiltonian is invariant under rotations and translations. In doing this, we introduce parametrizations and charts which help giving explicit…
We consider optimal two-impulse space interception problems with multi-constraints. The multi-constraints are imposed on the terminal position of an interceptor, impulse and impact instants, and the component-wise magnitudes of velocity…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
In this paper, we consider the decentralized optimization problems with generalized orthogonality constraints, where both the objective function and the constraint exhibit a distributed structure. Such optimization problems, albeit…
In this paper, we seek optimal solutions for a transfer from a parking orbit around the Moon to a halo orbit around $L_2$ of the Earth-Moon system, by applying a single maneuver and exploiting the stable invariant manifold of the hyperbolic…
This paper investigates the application of the Koopman Operator theory to the motion of a satellite about a libration point in the Circular Restricted Three-Body Problem. Recently, the Koopman Operator has emerged as a promising alternative…
This paper suggests two novel ideas to develop new proximal variable-metric methods for solving a class of composite convex optimization problems. The first idea is a new parameterization of the optimality condition which allows us to…
This paper proposes a method to compute lower performance bounds for discrete-time infinite-horizon min-max control problems with input constraints and bounded disturbances. Such bounds can be used as a performance metric for control…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We address optimal control problems on the space of measures for an objective containing a smooth functional and an optimal transport regularization. That is, the quadratic Monge-Kantorovich distance between a given prior measure and the…