相关论文: On computing fixpoints in well-structured regular …

We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine…

We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…

We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This framework goes beyond the classical Lipschitzian and H\"olderian error bounds and includes…

We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…

We derive a system of fixed-point equations for the equilibrium transfers in a class of one-to-one matching models with linear transferable utility. We then show that, when the degree of substitution between alternatives is bounded from…

A popular approach to the MAP inference problem in graphical models is to minimize an upper bound obtained from a dual linear programming or Lagrangian relaxation by (block-)coordinate descent. This is also known as convex/convergent…

In this paper we investigate the theoretical foundation of a new bottom-up semantics for linear logic programs, and more precisely for the fragment of LinLog that consists of the language LO enriched with the constant 1. We use constraints…

We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…

In this paper, we state and prove a generalization of \'Ciri\'c fixed point theorems in metric space by using a new generalized quasi-contractive map. These theorems extend other well known fundamental metrical fixed point theorems in the…

In this article, we demonstrate the common fixed point theorems for three transformations on vector S-metric space by utilizing weakly compatible and point of coincidence. Moreover, some of our results generalize the existing results in the…

In this paper, we show a series of abstract results on fixed point regularity with respect to a parameter. They are based on a Taylor development taking into account a loss of regularity phenomenon, typically occurring for composition…

In this paper we give an elementary proof of the convergence of corner cutting algorithms refining points, in case the corner cutting weights are taken from the rather general class of weights considered by Gregory and Qu (1996). We then…

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

In this paper, we prove several generalizations and applications of a fixed point theorem. This theorem is used to prove the existence and uniqueness of solutions of the linear sparse matrix problem considered.

We consider exact and averaged control problem for a system of quasi-linear ODEs and SDEs with a non-negative definite symmetric matrix of the system. The strategy of the proof is the standard linearization of the system by fixing the…

Expressive querying of machine learning models - viewed as a form of intentional data - enables their verification and interpretation using declarative languages, thereby making learned representations of data more accessible. Motivated by…

We introduce a new fixed point theorem of Krasnoselskii type for discontinuous operators. As an application we use it to study the existence of positive solutions of a second-order differential problem with separated boundary conditions and…

We obtain new results on the existence and multiplicity of fixed points of Hammerstein equations in very general cones. In order to achieve this, we combine a new formulation of cones in terms of continuous functionals with fixed point…

Recent advances in cutting-plane strategies applied to robust optimization problems show that they are competitive with respect to problem reformulations and interior-point algorithms. However, although its application with polyhedral…

We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.