4 citations · 6 across the 7 of their papers we have counts for
10 papers
Radial-type error bounds for semidefinite feasibility problems without strict feasibility: qualitative estimates and asymptotic tightness
Mitsuhiro Nishijima, Guoyin Li, Bruno F. Lourenço
In this paper, we develop a systematic framework for deriving explicit error bounds for semidefinite feasibility problems without assuming strict feasibility (Slater's condition),…
Classification of facial exposedness of completely positive cones over symmetric cones
Mitsuhiro Nishijima
We classify the facial exposedness of completely positive cones over symmetric cones in terms of the rank of the associated Euclidean Jordan algebras. The completely positive cones…
Copositive and completely positive cones over symmetric cones of rank at least 5
Mitsuhiro Nishijima
We study copositive and completely positive cones over symmetric cones of rank at least , with particular emphasis on whether these cones are spectrahedral shadows and on the be…
Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
Mitsuhiro Nishijima, Pierre-Louis Poirion, Akiko Takeda
In this paper, we propose a subgradient algorithm with a non-asymptotic convergence guarantee to solve copositive programming problems. The subproblem to be solved at each iteratio…
Facial structure of copositive and completely positive cones over a second-order cone
Mitsuhiro Nishijima, Bruno F. Lourenço
We classify the faces of copositive and completely positive cones over a second-order cone and investigate their dimension and exposedness properties. Then we compute two parameter…
Non-facial exposedness of copositive cones over symmetric cones
Mitsuhiro Nishijima, Bruno F. Lourenço
In this paper, we consider copositive cones over symmetric cones and show that they are never facially exposed when the underlying cone has dimension at least 2. We do so by explic…
On the longest chain of faces of the completely positive and copositive cones
Mitsuhiro Nishijima
We consider a wide class of closed convex cones in the space of real symmetric matrices and establish the existence of a chain of faces of , the length of which…
Approximation hierarchies for copositive cone over symmetric cone and their comparison
Mitsuhiro Nishijima, Kazuhide Nakata
We first provide an inner-approximation hierarchy described by a sum-of-squares (SOS) constraint for the copositive (COP) cone over a general symmetric cone. The hierarchy is a gen…
Generalizations of doubly nonnegative cones and their comparison
Mitsuhiro Nishijima, Kazuhide Nakata
In this study, we examine the various extensions of the doubly nonnegative (DNN) cone, frequently used in completely positive programming (CPP) to achieve a tighter relaxation than…
A Block Coordinate Descent Method for Sensor Network Localization
Mitsuhiro Nishijima, Kazuhide Nakata
The problem of sensor network localization (SNL) can be formulated as a semidefinite programming problem with a rank constraint. We propose a new method for solving such SNL proble…