相关论文: Convergence and efficiency of angular momentum pro…

In a calculation of rotated matrix elements with angular momentum projection, the generalized Wick's theorem may encounter a practical problem of combinatorial complexity when the configurations have more than four quasi-particles (qps).…

Many clustering applications in machine learning and data mining rely on solving metric-constrained optimization problems. These problems are characterized by $O(n^3)$ constraints that enforce triangle inequalities on distance variables…

The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications.…

We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number of closed convex sets. We present a unified strategy for…

This paper presents a unified approach for inverse and direct dynamics of constrained multibody systems that can serve as a basis for analysis, simulation, and control. The main advantage of the formulation of the dynamic is that it does…

We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to…

Projections onto sets are used in a wide variety of methods in optimization theory but not every method that uses projections really belongs to the class of projection methods as we mean it here. Here projection methods are iterative…

In this paper, we study alternating projections on nontangential manifolds based on the tangent spaces. The main motivation is that the projection of a point onto a manifold can be computational expensive. We propose to use the tangent…

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Projection-based iterative methods for solving large over-determined linear systems are well-known for their simplicity and computational efficiency. It is also known that the correct choice of a sketching procedure (i.e., preprocessing…

Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…

We extend coupled-cluster theory performed on top of a Slater determinant breaking rotational symmetry to allow for the exact restoration of the angular momentum at any truncation order. The main objective relates to the description of…

We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…

A simple, and elegant geometrical representation is developed to describe the concept of coherence and squeezing for angular momentum operators. Angular momentum squeezed states were obtained by applying Bogoliubov transformation on the…

A new algorithm is introduced to integrate the equations of rotational motion. The algorithm is derived within a leapfrog framework and the quantities involved into the integration are mid-step angular momenta and on-step orientational…

Methods of angular momenta are modified and used to solve some actual problems in quantum mechanics. In particular, we re-derive some known formulas for analytical and numerical calculations of matrix elements of the vector physical…

We study the alternating algorithm for the computation of the metric projection onto the closed sum of two closed subspaces in uniformly convex and uniformly smooth Banach spaces. For Banach spaces which are convex and smooth of power type,…

A moment body is a linear projection of the spectraplex, the convex set of trace-one positive semidefinite matrices. Determining whether a given point lies within a given moment body is a problem with numerous applications in quantum state…

A type of iterative orthogonally accumulated projection methods for solving linear system of equations are proposed in this paper. This type of methods are applications of accumulated projection(AP) technique proposed recently by authors.…

We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both…