相关论文: Convex and linear models of NP-problems
We extend to the anisotropic setting the existence of solutions for the Kirchhoff-Plateau problem and its dimensional reduction.
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
A class of generalized Schr\"{o}dinger elliptic problems involving concave-convex and other types of nonlinearities is studied. A reasonable overview about the set of solutions is provided when the parameters involved in the equation assume…
Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.
We study elimination theory in the context of Newton polytopes and develop its convex-geometric counterpart.
The set of bistochastic or doubly stochastic N by N matrices form a convex set called Birkhoff's polytope, that we describe in some detail. Our problem is to characterize the set of unistochastic matrices as a subset of Birkhoff's polytope.…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{\sigma}\ \forall \sigma\in S_n$. We define a second-order permutation matrix $P^{[2]}_{\sigma}$ in $\mathbb{R}^{n^2\times n^2}$ corresponding to a…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…
We linearize and solve the Van der Pol equation (with additional nonlinear terms) by the application of a generalized form of Cole-Hopf transformation. We classify also Lienard equations with low order polynomial coefficients which can be…
We prove that computing a shortest monotone path to the optimum of a linear program over a simple polytope is NP-hard, thus resolving a 2022 open question of De Loera, Kafer, and Sanit\`a. As a consequence, finding a shortest sequence of…
The Birkhoff polytope (the convex hull of the set of permutation matrices) is frequently invoked in formulating relaxations of optimization problems over permutations. The Birkhoff polytope is represented using $\Theta(n^2)$ variables and…
We give integral formulas to approximate solutions of Dirichlet and Neumann problems for Helmholtz equation at high frequencies. These approximations are valid in the complementary of a union of convex compact obstacles. The first step of…
Consider the following Kirchhoff type problem $$ \left\{\aligned -\bigg(a+b\int_{\mathbb{B}_R}|\nabla u|^2dx\bigg)\Delta u&= \lambda u^{q-1} + \mu u^{p-1}, &\quad \text{in}\mathbb{B}_R, \\ u&>0,&\quad\text{in}\mathbb{B}_R,\\…
This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…
The Birkhoff polytope $B_n$ is the convex hull of all $n\times n$ permutation matrices in $\mathbb{R}^{n\times n}$. We compute the combinatorial symmetry group of the Birkhoff polytope. A representation polytope is the convex hull of some…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.