Related papers: On multi-conditioned conic fitting in Geometric al…
We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…
Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…
A geometric nonconvex conic optimization problem (COP) was recently proposed by Kim, Kojima and Toh as a unified framework for convex conic reformulation of a class of quadratic optimization problems and polynomial optimization problems.…
We develop a cut finite element method for a second order elliptic coupled bulk-surface model problem. We prove a priori estimates for the energy and $L^2$ norms of the error. Using stabilization terms we show that the resulting algebraic…
Lattice discretisation errors in the Landau gauge condition are examined. An improved gauge fixing algorithm in which order a^2 errors are removed is presented. Order a^2 improvement of the gauge fixing condition displays the secondary…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
In this paper we study generic M(atrix) theory compactifications that are specified by a set of quotient conditions. A procedure is proposed, which both associates an algebra to each compactification and leads deductively to general…
We propose an algorithm for generating explicit solutions of multiparametric mixed-integer convex programs to within a given suboptimality tolerance. The algorithm is applicable to a very general class of optimization problems, but is most…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
A characterization of the symmetry algebra of the $n$th order ordinary differential equations (ODEs) with maximal symmetry and all third order linearizable ODEs is given. This is used to show that such an algebra $\mathfrak{g}$ determines…
A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.
We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods -- geometric fit, Kasa fit, Pratt fit, and Taubin fit -- is…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
We propose the formulation of convex Generalized Disjunctive Programming (GDP) problems using conic inequalities leading to conic GDP problems. We then show the reformulation of conic GDPs into Mixed-Integer Conic Programming (MICP)…
Assembly of large scale structural systems in space is understood as critical to serving applications that cannot be deployed from a single launch. Recent literature proposes the use of discrete modular structures for in-space assembly and…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to…