Related papers: Circuit imbalance measures and linear programming
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb…
A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
We are witnessing the birth of a new variety of pharmacokinetics where non-integer-order differential equations are employed to study the time course of drugs in the body: this is dubbed "fractional pharmacokinetics." The presence of…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…
This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…
In this paper, we propose a metric on the space of finite sets of trajectories for assessing multi-target tracking algorithms in a mathematically sound way. The main use of the metric is to compare estimates of trajectories from different…
Using an attractive Hubbard model we examine spatial variations of superconducting order parameter and local charge on a two dimensional lattice. For various band filling we show the effect of destruction of the order parameter around a…
In this paper, we derive a framework to understand the effect of imperfections on the phasematching spectrum of a wide class of nonlinear systems. We show that this framework is applicable to many physical systems, such as waveguides or…
Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time…
We study the fine geometric structure of bifurcation currents in the parameter space of cubic polynomials viewed as dynamical systems. In particular we prove that these currents have some laminar structure in a large region of parameter…
For a real matrix $A \in \mathbb{R}^{d \times n}$ with non-collinear columns, we show that $n \leq O(d^4 \kappa_A)$ where $\kappa_A$ is the \emph{circuit imbalance measure} of $A$. The circuit imbalance measure $\kappa$ is a real analogue…
This paper considers mathematical programs, whose constraints are expressed by a parameterized vector equilibrium problem. The latter is a well recognized framework, which is able to cover multicriteria optimization, vector variational…
Methods for the computation of invariants and symmetries of nonlinear evolution, wave, and lattice equations are presented. The algorithms are based on dimensional analysis, and can be implemented in any symbolic language, such as…
We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…
Program behavior may depend on parameters, which are either configured before compilation time, or provided at run-time, e.g., by sensors or other input devices. Parametric program analysis explores how different parameter settings may…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
We show how interferometry can be used to characterise certain aspects of general quantum processes, in particular, the coherence of completely positive maps. We derive a measure of coherent fidelity, maximum interference visibility and the…