Related papers: Symplectic algorithm for systems with second-class…
A new geometric procedure to construct symplectic methods for constrained mechanical systems is developed in this paper. The definition of a map coming from the notion of retraction maps allows to adapt the continuous problem to the…
In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently…
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…
Modifications of the smacof algorithm for multidimensional scaling are proposed that provide a convergent majorization algorithm for Kruskal's stress formula two.
For discrete spectrum of 1D second-order differential/difference operators (with or without potential (killing), with the maximal/minimal domain), a pair of unified dual criteria are presented in terms of two explicit measures and the…
Optimization problems with convex quadratic cost and polyhedral constraints are ubiquitous in signal processing, automatic control and decision-making. We consider here an enlarged problem class that allows to encode logical conditions and…
In the framework of polysymplectic Hamiltonian formalism, degenerate Lagrangian field systems are described as multi-Hamiltonian systems with Lagrangian constraints. The physically relevant case of degenerate quadratic Lagrangians is…
The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…
This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
The equivalence between the Dirac method and Faddeev-Jackiw analysis for gauge theories is proved. In particular we trace out, in a stage by stage procedure, the standard classification of first and second class constraints of Dirac's…
We analyze a class of coupled quantum systems whose dynamics can be understood via two uncoupled, lower-dimensional quantum settings with auxiliary interactions. The general reduction scheme, based on algebraic properties of the potential…
We present a new feasible proximal gradient method for constrained optimization where both the objective and constraint functions are given by the summation of a smooth, possibly nonconvex function and a convex simple function. The…
It is shown that an arbitrary singular Lagrangian theory (with first and second class constraints up to $N$-th stage in the Hamiltonian formulation) can be reformulated as a theory with at most third-stage constraints. The corresponding…
By using the supersymmetric version of the Faddeev-Jackiw symplectic formalism, a family of first-order constrained Lagrangians for the t-J model is found. In this approach the Hubbard ${\hat X}$-operators are used as field variables. In…
A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…
In this work we discuss the natural appearance of the Generalized Brackets in systems with non-involutive (equivalent to second class) constraints in the Hamilton-Jacobi formalism. We show how a consistent geometric interpretation of the…
We provide algorithms for computing a Lyapunov function for a class of systems where the state trajectories are constrained to evolve within a closed convex set. The dynamical systems that we consider comprise a differential equation which…
A new algorithm is developed allowing the Monte Carlo study of a 1 + 1 dimensional theory in real time. The main algorithmic development is to avoid the explicit calculation of the Jacobian matrix and its determinant in the update process.…
Many problems in science and engineering fields require the solution of shifted linear systems. To solve such systems efficiently, the recycling BiCG (RBiCG) algorithm in [SIAM J. SCI. COMPUT, 34 (2012) 1925-1949] is extended in this paper.…