Related papers: A Note on Shortest Developments
The aim of the paper is to show that the solutions to variational problems with non-standard growth conditions satisfy a corresponding variational inequality without any smallness assumptions on the gap between growth and coercitivity…
We consider the Schr\"odinger evolution on graph, i.e. solution to the equation $\partial_tu(t,\alpha)=i\sum_{\beta\in\mathcal{A}}L(\alpha,\beta)u(t,\beta)$, here $\mathcal{A}$ is the set of vertices of the graph and the matrix…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
The values of many phenomena in the Nature $z$ are determined in some discrete set of times t_n, separated by a small interval $\Delta t$ (which may also represent a coordinate, etc.). Let the $z$ value in neighbour point…
Residual finiteness growth gives an invariant that indicates how well-approximated a finitely generated group is by its finite quotients. We briefly survey the state of the subject. We then improve on the best known upper and lower bounds…
By carrying out a point-wise estimate for the second fundamental form, we prove a rigidity theorem of complete noncompact ancient solutions to the mean curvature flow in codimension one. Moreover, we derive an optimal growth condition.
We prove weak duality between two recent convex relaxation methods for bounding the optimal value of a constrained variational problem in which the objective is an integral functional. The first approach, proposed by Valmorbida et al. (IEEE…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a dierence between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…
Derrick's theorem on the nonexistence of stable time-independent scalar field configurations [G. H. Derrick, J. Math. Phys. 5, 1252 (1964)] is generalized to finite systems of arbitrary dimension. It is shown that the "dilation" argument…
In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…
This research is concerned with evolution equations and their forward-backward discretizations. Our first contribution is an estimation for the distance between iterates of sequences generated by forward-backward schemes, useful in the…
Duality theorems play a fundamental role in convex optimization. Recently, it was shown how duality theorems for countable probability distributions and finite-dimensional quantum states can be leveraged for building relatively complete…
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of the loop body. In this paper we consider the problem of…
The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…
We propose and analyse numerical schemes for a system of quasilinear, degenerate evolution equations modelling biofilm growth as well as other processes such as flow through porous media and the spreading of wildfires. The first equation in…
The work studies the problem of decentralized constrained POMDPs in a team-setting where multiple nonstrategic agents have asymmetric information. Using an extension of Sion's Minimax theorem for functions with positive infinity and results…
In the standard sequent presentations of Girard's Linear Logic (LL), there are two "non-decreasing" rules, where the premises are not smaller than the conclusion, namely the cut and the contraction rules. It is a universal concern to…
We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…