Related papers: Point Decomposition Problem in Binary Elliptic Cur…
We study the quadratic $k$-vertex-disjoint paths problem (Q-$k$-VDP), which seeks $k$ vertex-disjoint paths in a directed graph that minimize a nonconvex quadratic objective function. We formulate the problem as a binary quadratic program…
In a previous paper [Nijhoff,Puttock,2003], a 2-parameter extension of the lattice potential KdV equation was derived, associated with an elliptic curve. This comprises a rather complicated 3-component system on the quad lattice which…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper, we propose a $W$-cycle $p$-multigrid method for solving the $p$-version symmetric interior penalty discontinuous Galerkin (SIPDG) discretization of elliptic problems. This SIPDG discretization employs hierarchical Legendre…
In this paper we study elliptic curves which have a number of points whose coordinates are in arithmetic progression. We first motivate this diophantine problem, prove some results, provide a number of interesting examples and, finally…
The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization techniques which is based on Mathematical Programming with…
The notion of $p$-ellipticity has recently played a significant role in improving our understanding of issues of solvability of boundary value problems for scalar complex valued elliptic PDEs. In particular, the presence of $p$-ellipticity…
The multi-objective optimization is to optimize several objective functions over a common feasible set. Since the objectives usually do not share a common optimizer, people often consider (weakly) Pareto points. This paper studies…
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing:…
Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…
In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper and the lower level problems are polynomials. We present methods for finding its global minimizers and…
We prove the existence and uniqueness of weak solution of a Neumann boundary problem for an elliptic partial differential equation (PDE for short) with a singular divergence term which can only be understood in a weak sense. A probabilistic…
Saddle-point problems appear in various settings including machine learning, zero-sum stochastic games, and regression problems. We consider decomposable saddle-point problems and study an extension of the alternating direction method of…
On compact Riemannian manifolds, we prove a decomposition theorem for arbitrarily bounded energy sequence of solutions of a singular elliptic equation.
A mathematical programming problem with affine equilibrium constraints (AMPEC) is a bilevel programming problem where the lower one is a parametric affine variational inequality. We formulate some classes of bilevel programming in forms of…
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise…
On a Riemannian compact manifold, we give existence and multiplicity results for solutions of elliptic PDE by introducing isometry invariances. When the groups we used have finite orbits, we get multiplicity results for equations with the…
In this paper, we consider a probabilistic set covering problem (PSCP) in which each 0-1 row of the constraint matrix is random with a finite discrete distribution, and the objective is to minimize the total cost of the selected columns…
A computer-algebra aided method is carried out, for determining geometric objects associated to differential operators that satisfy the elliptic ansatz. This results in examples of Lame curves with double reduction and in the explicit…