相关论文: Direct and dual laws for automata with multiplicit…
This article develops a primal dual formulation for a primal proximal approach suitable for a large class of non-convex models in the calculus of variations. The results are established through standard tools of functional analysis, convex…
We are interested in solving convex optimization problems with large numbers of constraints. Randomized algorithms, such as random constraint sampling, have been very successful in giving nearly optimal solutions to such problems. In this…
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…
This paper studies duality and optimality conditions for general convex stochastic optimization problems. The main result gives sufficient conditions for the absence of a duality gap and the existence of dual solutions in a locally convex…
A new, extended nonlinear framework of the ordinary real analysis incorporating a novel concept of {\em duality structure} and its applications into various nonlinear dynamical problems is presented. The duality structure is an asymptotic…
Many phenomena in physics, chemistry, and biology involve seeking an optimal control to maximize an objective for a classical or quantum system which is open and interacting with its environment. The complexity of finding an optimal control…
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…
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions of agents in order to enforce a given property. In this…
This work is concerned with the efficient optimization method for solving a large class of optimal mass transport problems. An inexact primal-dual algorithm is presented from the time discretization of a proper dynamical system, and by…
The solutions that describe the motion of the classical simple pendulum have been known for very long time and are given in terms of elliptic functions, which are doubly periodic functions in the complex plane. The independent variable of…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
We introduce propositional team-based logics expressively complete for (quasi) downward and (quasi) upward closed properties in a syntactically dual way, by using variants of the inclusion atom. In particular, the variants of the primitive…
Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the…
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…
It is well known that (timed) $\omega$-regular properties such as `p holds at every even position' and `p occurs at least three times within the next 10 time units' cannot be expressed in Metric Interval Temporal Logic ($\mathsf{MITL}$) and…
We combine tools from homotopy continuation solvers with the methods of analytic combinatorics in several variables to give the first practical algorithm and implementation for the asymptotics of multivariate rational generating functions…
We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
An integer program is called ideal if its continuous relaxation coincides with its convex hull allowing the problem to be solved as a continuous program and offering substantial computational advantages. Proving idealness analytically can…
We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the…
Recently, Aum\"uller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called "Count", which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further…