18 citations · 54 across the 12 of their papers we have counts for
12 papers
Computational Dating for the Nuzi Cuneiform Archive: The Least Squares Constrained by Family Trees and Synchronisms
Sumie Ueda, Takashi Tsuchiya, Yoshiaki Itoh
We introduce a computational method of dating for an archive in ancient Mesopotamia. We use the name index Nuzi Personal Names (NPN) published in 1943. We made an electronic versio…
Closing Duality Gaps of SDPs through Perturbation
Takashi Tsuchiya, Bruno F. Lourenço, Masakazu Muramatsu +1
Let be a primal-dual pair of SDPs with a nonzero finite duality gap. Under such circumstances, and are weakly feasible and if we perturb the…
A Limiting Analysis on Regularization of Singular SDP and its Implication to Infeasible Interior-point Algorithms
Takashi Tsuchiya, Bruno F. Lourenco, Masakazu Muramatsu +1
We consider primal-dual pairs of semidefinite programs and assume that they are ill-posed, i.e., both primal and dual are either weakly feasible or weakly infeasible. Under such ci…
An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP
Masakazu Muramatsu, Tomonari Kitahara, Bruno F. Lourenço +2
We point out that Chubanov's oracle-based algorithm for linear programming [5] can be applied almost as it is to linear semi-infinite programming (LSIP). In this note, we describe…
An extension of Chubanov's algorithm to symmetric cones
Bruno F. Lourenço, Tomonari Kitahara, Masakazu Muramatsu +1
In this work we present an extension of Chubanov's algorithm to the case of homogeneous feasibility problems over a symmetric cone K. As in Chubanov's method for linear feasibility…
An Extension of Chubanov's Polynomial-Time Linear Programming Algorithm to Second-Order Cone Programming
Tomonari Kitahara, Takashi Tsuchiya
Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone programming.
Implementation of Interior-point Methods for LP based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning
Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya +1
We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed…
Facial Reduction and Partial Polyhedrality
Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya
We present FRA-Poly, a facial reduction algorithm (FRA) for conic linear programs that is sensitive to the presence of polyhedral faces in the cone. The main goals of FRA and FRA-P…
Weak Infeasibility in Second Order Cone Programming
Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya
The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly…
A structural geometrical analysis of weakly infeasible SDPs
Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya
In this article, we present a geometric theoretical analysis of semidefinite feasibility problems (SDFPs). This is done by decomposing a SDFP into smaller problems, in a way that p…
Solving SDP Completely with an Interior Point Oracle
Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya
We suppose the existence of an oracle which solves any semidefinite programming (SDP) problem satisfying Slater's condition simultaneously at its primal and dual sides. We note tha…
Double Precision Computation of the Logistic Map Depends on Computational Modes of the Floating-point Processing Unit
Michiro Yabuki, Takashi Tsuchiya
Today's most popular CPU can operate in two different computational modes for double precision computations. This fact is not very widely recognized among scientific computer users…