Related papers: On Tropical Linear and Integer Programs
We develop an inexact primal-dual first-order smoothing framework to solve a class of non-bilinear saddle point problems with primal strong convexity. Compared with existing methods, our framework yields a significant improvement over the…
The entropy of a tropical ideal is introduced. The radical of a tropical ideal consists of all tropical polynomials vanishing on the tropical prevariety determined by the ideal. We prove that the entropy of the radical of a tropical…
This paper shows that the implicit bias of gradient descent on linearly separable data is exactly characterized by the optimal solution of a dual optimization problem given by a smoothed margin, even for general losses. This is in contrast…
We optimize the running time of the primal-dual algorithms by optimizing their stopping criteria for solving convex optimization problems under affine equality constraints, which means terminating the algorithm earlier with fewer…
This paper develops a continuous-time primal-dual accelerated method with an increasing damping coefficient for a class of convex optimization problems with affine equality constraints. This paper analyzes critical values for parameters in…
The quantum many-body problem can be rephrased as a variational determination of the two-body reduced density matrix, subject to a set of N-representability constraints. The mathematical problem has the form of a semidefinite program. We…
We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…
We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings and semifields with idempotent addition. Given a set of samples, each consisting of the input and…
We consider the tropical analogues of a particular bilevel optimization problem studied by Dempe and Franke and suggest some methods of solving these new tropical bilevel optimization problems. In particular, it is found that the algorithm…
We consider the saddle point problem where the objective functions are abstract convex with respect to the class of quadratic functions. We propose primal-dual algorithms using the corresponding abstract proximal operator and investigate…
Suppose that f is a function from Z_p -> [0,1] (Z_p is my notation for the integers mod p, not the p-adics), and suppose that a_1,...,a_k are some places in Z_p. In some additive number theory applications it would be nice to perturb f…
We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\{ Ax \geq r \}$ minimizing a non-negative…
We prove general Cramer type theorems for linear systems over various extensions of the tropical semiring, in which tropical numbers are enriched with an information of multiplicity, sign, or argument. We obtain existence or uniqueness…
We present a primal-dual majorization-minimization method for solving large-scale linear programs. A smooth barrier augmented Lagrangian (SBAL) function with strict convexity for the dual linear program is derived. The…
Inverse optimization is the problem of determining the values of missing input parameters for an associated forward problem that are closest to given estimates and that will make a given target vector optimal. This study is concerned with…
In this paper, we propose two exact distributed algorithms to solve mixed integer linear programming (MILP) problems with multiple agents where data privacy is important for the agents. A key challenge is that, because of the non-convex…
We present an algorithm for computing zero-dimensional tropical varieties using projections. Our main tools are fast unimodular transforms of lexicographical Gr\"obner bases. We prove that our algorithm requires only a polynomial number of…
The shortest bibranching problem is a common generalization of the minimum-weight edge cover problem in bipartite graphs and the minimum-weight arborescence problem in directed graphs. For the shortest bibranching problem, an efficient…
In this note, we propose a novel technique to reduce the algorithmic complexity of neural network training by using matrices of tropical real numbers instead of matrices of real numbers. Since the tropical arithmetics replaces…
We study the classical result by Bruijn and Erd\H os regarding the bound on the number of lines determined by a $n$-point configuration in the plane, and in the light of the recently proven Tropical Sylvester-Gallai theorem, come up with a…