Muramatsu Masakazu

Masakazu Muramatsu

Information about the author Masakazu Muramatsu will soon be added to the site.
Found 10 papers in total
Weak infeasibility in second order cone programming
2016
The objective of this work is to study weak infeasibility in second order cone...
Facial Reduction Algorithms for Conic Optimization Problems
2013
In the conic optimization problems, it is well‐known that a positive duality...
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
2012
We observe that in a simple one‐dimensional polynomial optimization problem...
Equality based contraction of semidefinite programming relaxations in polynomial optimization
2008
The SDP (semidefinite programming) relaxation for general POPs (polynomial...
A unified class of directly solvable semidefinite programming problems
2005
We propose a class of semidefinite programming (SDP) problems for which an optimal...
A new second–order cone programming relaxation for max-cut problems
2003
We propose a new relaxation scheme for the MAX–CUT problem using second-order...
On network simplex method using the primal–dual symmetric pivoting rule
2000
We consider a network simplex method using the primal–dual symmetric pivoting...
Affine scaling algorithm fails for semidefinite programming
1998
In this paper, we introduce an affine scaling algorithm for semidefinite programming...
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
1996
In this paper the authors give a new convergence analysis of a projective scaling...
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
1996
In this paper, the authors propose an infeasible-interior-point algorithm for linear...
Papers per page: