Related papers: A geometric approach to cut-generating functions
Introduction of curvilinear coordinates might be very convenient in many cases. Theoretically, tensor analysis would be most suited. However, tensor notation can't be used in numerical procedure. For example, the strict discrimination of…
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…
The art of quantum algorithm design is highly nontrivial. Grover's search algorithm constitutes a masterpiece of quantum computational software. In this article, we use methods of geometric algebra (GA) and information geometry (IG) to…
Current state-of-the-art methods for solving discrete optimization problems are usually restricted to convex settings. In this paper, we propose a general approach based on cutting planes for solving nonlinear, possibly nonconvex, binary…
About ten years ago, a paper proposed the first integer linear programming formulation for the constrained two-dimensional guillotine cutting problem (with unlimited cutting stages). Since, six other formulations followed, five of them in…
We compute the integer cohomology rings of the ``polygon spaces'' introduced in [Hausmann,Klyachko,Kapovich-Millson]. This is done by embedding them in certain toric varieties; the restriction map on cohomology is surjective and we…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithm to solve this class…
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational…
Cut-generating linear programs (CGLPs) play a key role as a separation oracle to produce valid inequalities for the feasible region of mixed-integer programs. When incorporated inside branch-and-bound, the cutting planes obtained from CGLPs…
Geometric algebra is a powerful framework that unifies mathematics and physics. Since its revival in the middle of the 1960s by David Hestenes, it attracts great attention and has been exploited in many fields such as physics, computer…
The author proposes a new geometry in this book. The author named this new geometry Intercenter Geometry. Intercenter Geometry is different from traditional Euclidean geometry and analytic geometry (coordinate geometry). The idea of…
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…
Program code serves as a bridge linking vision and logic, providing a feasible supervisory approach for enhancing the multimodal reasoning capability of large models through geometric operations such as auxiliary line construction and…
Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimization problems is the…
We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…
Quantum computing is a new way of data processing based on the concept of quantum mechanics. Quantum circuit design is a process of converting a quantum gate to a series of basic gates and is divided into two general categories based on the…
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet…
We present pure-integer Gomory cuts in a way so that they are derived with respect to a "dual form" pure-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. The input…