Related papers: Lagrange versus Symplectic Algorithm for Constrain…
This paper is devoted to the study of acceleration methods for an inequality constrained convex optimization problem by using Lyapunov functions. We first approximate such a problem as an unconstrained optimization problem by employing the…
A method to construct a geometric structure with the same solutions as a given variational principle is presented. The method applies to large families of variational principles. In particular, the known results that assign cosymplectic…
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…
A stochastic linear quadratic (LQ) optimal control problem with a pointwise linear equality constraint on the terminal state is considered. A strong Lagrangian duality theorem is proved under a uniform convexity condition on the cost…
An explicit high-order noncanonical symplectic algorithm for ideal two-fluid systems is developed. The fluid is discretized as particles in the Lagrangian description, while the electromagnetic fields and internal energy are treated as…
We consider quantum mechanics on constrained surfaces which have non-Euclidean metrics and variable Gaussian curvature. The old controversy about the ambiguities involving terms in the Hamiltonian of order hbar^2 multiplying the Gaussian…
In this paper, we present a stochastic augmented Lagrangian approach on (possibly infinite-dimensional) Riemannian manifolds to solve stochastic optimization problems with a finite number of deterministic constraints.We investigate the…
We present a reduction procedure for gauge theories based on quotienting out the kernel of the presymplectic form in configuration-velocity space. Local expressions for a basis of this kernel are obtained using phase space procedures; the…
In this paper, we introduce faster accelerated primal-dual algorithms for minimizing a convex function subject to strongly convex function constraints. Prior to our work, the best complexity bound was $\mathcal{O}(1/{\varepsilon})$,…
Most numerical integration algorithms are not designed specifically for Hamiltonian systems and do not respect their characteristic properties, which include the preservation of phase space volume with time. This can lead to spurious…
We analyze the canonical treatment of classical constrained mechanical systems formulated with a discrete time. We prove that under very general conditions, it is possible to introduce nonsingular canonical transformations that preserve the…
It is shown that the Lagrangian reduction, in which solutions of equations of motion that do not involve time derivatives are used to eliminate variables, leads to results quite different from the standard Dirac treatment of the first order…
We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, Waltz, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a…
Using the basic concepts of chain by chain method we show that the symplectic analysis, which was claimed to be equivalent to the usual Dirac method, fails when second class constraints are present. We propose a modification in symplectic…
In this paper, we aim at unifying, simplifying and improving the convergence rate analysis of Lagrangian-based methods for convex optimization problems. We first introduce the notion of nice primal algorithmic map, which plays a central…
D-dimensional constrained systems are studied with stochastic Lagrangian and\break Hamiltonian. It is shown that stochastic consistency conditions are second class constraints and Lagrange multiplier fields can be determined in…
We are able to derive the equations of motion for forced mechanical systems in a purely variational setting, both in the context of Lagrangian or Hamiltonian mechanics, by duplicating the variables of the system as introduced by Galley…
We present a geometric algorithm for obtaining consistent solutions to systems of partial differential equations, mainly arising from singular covariant first-order classical field theories. This algorithm gives an intrinsic description of…
The geometry of a Lagrangian mechanical system is determined by its associated evolution semispray. We uniquely determine this semispray using the symplectic structure and the energy of the Lagrange space and the external force field. We…
In general, the system of $2$nd-order partial differential equations made of the Euler-Lagrange equations of classical field theories are not compatible for singular Lagrangians. This is the so-called second-order problem. The first aim of…