Masakazu Muramatsu

From MaRDI portal
Revision as of 03:13, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:323031

Available identifiers

zbMath Open muramatsu.masakazuMaRDI QIDQ323031

List of research outcomes





PublicationDate of PublicationType
Closing duality gaps of SDPs completely through perturbation when singularity degree is one2024-11-28Paper
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms2023-05-25Paper
Closing Duality Gaps of SDPs through Perturbation2023-04-10Paper
Solving SDP completely with an interior point oracle2021-07-06Paper
An extension of Chubanov's algorithm to symmetric cones2019-02-07Paper
An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP2018-09-27Paper
Facial Reduction and Partial Polyhedrality2018-09-12Paper
Weak infeasibility in second order cone programming2017-03-28Paper
A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS2016-12-16Paper
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs2016-10-07Paper
Perturbed sums-of-squares theorem for polynomial optimization and its applications2016-06-10Paper
Facial reduction algorithms for conic optimization problems2013-09-23Paper
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization2013-02-18Paper
AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions))2012-12-08Paper
A facial reduction algorithm for finding sparse SOS representations2010-12-20Paper
https://portal.mardi4nfdi.de/entity/Q36324522009-06-11Paper
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones2009-02-13Paper
EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION2008-07-11Paper
https://portal.mardi4nfdi.de/entity/Q54424882008-02-22Paper
An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones2007-05-10Paper
A pivoting procedure for a class of second-order cone programming2006-07-13Paper
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity2006-05-30Paper
An efficient support vector machine learning method with second-order cone programming for large-scale problems2005-12-14Paper
A unified class of directly solvable semidefinite programming problems2005-04-22Paper
A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS2004-01-26Paper
The Gauss-Newton direction in semidefinite programming2002-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45381712002-07-11Paper
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q47039051999-12-01Paper
Affine scaling algorithm fails for semidefinite programming1999-06-03Paper
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm1997-01-06Paper
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption1996-10-24Paper
Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems1995-11-01Paper

Research outcomes over time

This page was built for person: Masakazu Muramatsu