We study monotonicity of primal and dual objective values in the framework of primal-dual interior-point methods. The primal-dual aane-scaling algorithm is monotone in both objectives. We derive a condition under which a primal-dualinterior-point algorithm with a centering component is monotone. Then we propose primal-dual algorithms that are monotone in both primal and dual objective values an...

In this paper, we study polynomial-time interior-point algorithms in view of information geometry. Information geometry is a differential geometric framework which has been successfully applied to statistics, learning theory, signal processing etc. We consider information geometric structure for conic linear programs introduced by self-concordant barrier functions, and develop a precise iterati...

Motivated by various applications to computer vision, we consider the convex cost tension problem, which is the dual of the convex cost flow problem. In this paper, we first propose a primal algorithm for computing an optimal solution of the problem. Our primal algorithm iteratively updates primal variables by solving associated minimum cut problems. We show that the time complexity of the prim...

Using theorem prover Coq [4] for the verification of concurrent systems usually includes the formalization of the modal μ–calculus [8] in that logical framework [13] [11] [15]. These implementations build upon the following interpretation: given the state space S of a system, the meaning of a formula is the subset of states where it is satisfied. Then, a formula α(X) with a free variable X can ...

A type system for the lambda-calculus enriched with recursive and corecursive functions over equi-inductive and -coinductive types is presented in which all well-typed programs are strongly normalizing. The choice of equi-inductive types, instead of the more common isoinductive types, in uences both reduction rules and the strong normalization proof. By embedding isointo equi-types, the latter ...

In this paper, we define the notions of ultra and involution ideals in $BCK$-algebras. Then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. Specially, we show that in a bounded implicative $BCK$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $BCK$-semilattice, the not...

The foldness of PI( , , ⊆)BCK -ideals and PI(⊆, ⊆, ⊆)BCK -ideals is considered, and their properties are investigated. Hyper homomorphic inverse image of PI( , , ⊆)BCK -ideals, PI( , ⊆, ⊆)BCK -ideals, PI(⊆, ⊆, ⊆)BCK -ideals, and PI( , , )BCK -ideals are discussed.

Let $R$ be a commutative ring. The purpose of this article is to introduce a new class of ideals of R called weakly irreducible ideals. This class could be a generalization of the families quasi-primary ideals and strongly irreducible ideals. The relationships between the notions primary, quasi-primary, weakly irreducible, strongly irreducible and irreducible ideals, in different rings, has bee...