Related papers: Projective Root-Locus: An Extension of Root-Locus …
We consider the robust multi-dimensional scaling (RMDS) problem in this paper. The goal is to localize point locations from pairwise distances that may be corrupted by outliers. Inspired by classic MDS theories, and nonconvex works for the…
Rapidly-exploring random trees (RRTs) have been widely adopted for robot motion planning due to their robustness and theoretical guarantees. However, existing RRT-based planners require explicit goal configurations specified as numerical…
This is a first paper in a project on extending the dream principalization and resolution methods of [ATW24], [McQ20] and [Que22] to quasi-excellent, logarithmic and relative settings. We show that the main results of [ATW24] extend to…
Sparse linear regression is one of the classic problems in the field of statistics, which has deep connections and high intersections with optimization, computation, and machine learning. To address the effective handling of…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving affine subspaces. In this setting, it was shown to outperform…
Affine forms are a common way to represent convex sets of $\mathbb{R}$ using a base of error terms $\epsilon \in [-1, 1]^m$. Quadratic forms are an extension of affine forms enabling the use of quadratic error terms $\epsilon_i \epsilon_j$.…
Affine geometry is usually regarded as a framework in which metric notions such as distance and angle are absent. However, just as projective geometry produces various metric geometries by introducing additional structures on the line at…
We study how an irreducible closed algebraic curve X embedded in CP^3 can be recovered using its projections from points onto embedded projective planes. The different embeddings are unknown. The only input is the defining equation of each…
The group PGL(3) of linear transformations of the projective plane acts naturally on the projective space parametrizing curves of a given degree. In this note we begin the study of the orbits of smooth curves under this action: we construct…
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
Decision trees are one of the most widely used nonparametric methods for regression and classification. In existing literature, decision tree-based methods have been used for estimating continuous functions or piecewise-constant functions.…
Recent technical advances in collecting spatial data have been increasing the demand for methods to analyze large spatial datasets. The statistical analysis for these types of datasets can provide useful knowledge in various fields.…
Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…
Dimensionality reduction-based dictionary learning methods in the literature have often used iterative random projections. The dimensionality of such a random projection matrix is a random number that might not lead to a separable subspace…
We introduce invariant rings for forms (homogeneous polynomials) and for d points on the projective space, from the point of view of representation theory. We discuss several examples, addressing some computational issues. We introduce the…
Projected-search methods for bound-constrained optimization are based on performing a search along a piecewise-linear continuous path obtained by projecting a search direction onto the feasible region. A benefit of these methods is that…
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…
The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…