Related papers: Projection onto quadratic hypersurfaces
Generalized alternating projections is an algorithm that alternates relaxed projections onto a finite number of sets to find a point in their intersection. We consider the special case of two linear subspaces, for which the algorithm…
This article is a continuation of a previous article which concerned the splitting problem for subspaces of superspaces. We begin with a general account of projective superspaces. Subsequently, we specialise to subvarieties of `positive'…
We present a sharp collocated projection method for solving the immiscible, two-phase Navier-Stokes equations in two- and three-dimensions. Our method is built using non-graded adaptive quadtree and octree grids, where all of the fluid…
We prove that the Douglas--Rachford method applied to two closed convex cones in the Euclidean plane converges in finitely many steps if and only if the set of fixed points of the Douglas--Rachford operator is nontrivial. We analyze this…
This paper introduces a new method of partitioning the solution space of a multi-objective optimisation problem for parallel processing, called Efficient Projection Partitioning. This method projects solutions down into a single dimension,…
We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimise the sum of the first Dirichlet Laplace--Beltrami operator eigenvalues over a given number of partitions of a surface. We consider…
This paper introduces a method of calculating and rendering shapes in a non-Euclidean 2D space. In order to achieve this, we developed a physics and graphics engine that uses hyperbolic trigonometry to calculate and subsequently render the…
Convex quadratic programs (QPs) are fundamental to numerous applications, including finance, engineering, and energy systems. Among the various methods for solving them, the Douglas-Rachford (DR) splitting algorithm is notable for its…
A version of the Hardy-Littlewood circle method is developed for number fields K/Q and is used to show that non-singular projective cubic hypersurfaces over K always have a K-rational point when they have dimension at least 8.
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
We consider applications involving a large set of instances of projecting points to polytopes. We develop an intuition guided by theoretical and empirical analysis to show that when these instances follow certain structures, a large…
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…
We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
We consider the problem of projecting a vector onto the so-called k-capped simplex, which is a hyper-cube cut by a hyperplane. For an n-dimensional input vector with bounded elements, we found that a simple algorithm based on Newton's…
Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…
Many applications using large datasets require efficient methods for minimizing a proximable convex function subject to satisfying a set of linear constraints within a specified tolerance. For this task, we present a proximal projection…
In this paper we provide an efficient computation of the projection onto the cone generated by the epigraph of the perspective of any convex lower semicontinuous function. Our formula requires solving only two scalar equations involving the…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…
This article introduces efficient and user-friendly tools for analyzing the intersection curve between a ringed torus and an irreducible quadric surface. Without loose of generality, it is assumed that the torus is centered at the origin,…