| Publication | Date of Publication | Type |
|---|
Closing duality gaps of SDPs completely through perturbation when singularity degree is one
Optimization Methods & Software | 2024-11-28 | Paper |
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
Mathematical Programming. Series A. Series B | 2023-05-25 | Paper |
| Closing Duality Gaps of SDPs through Perturbation | 2023-04-10 | Paper |
Solving SDP completely with an interior point oracle
Optimization Methods & Software | 2021-07-06 | Paper |
An extension of Chubanov's algorithm to symmetric cones
Mathematical Programming. Series A. Series B | 2019-02-07 | Paper |
| An oracle-based projection and rescaling algorithm for linear semi-infinite feasibility problems and its application to SDP and SOCP | 2018-09-27 | Paper |
Facial reduction and partial polyhedrality
SIAM Journal on Optimization | 2018-09-12 | Paper |
Weak infeasibility in second order cone programming
Optimization Letters | 2017-03-28 | Paper |
A structural geometrical analysis of weakly infeasible SDPS
Journal of the Operations Research Society of Japan | 2016-12-16 | Paper |
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs
Discrete Applied Mathematics | 2016-10-07 | Paper |
Perturbed sums-of-squares theorem for polynomial optimization and its applications
Optimization Methods & Software | 2016-06-10 | Paper |
Facial reduction algorithms for conic optimization problems
Journal of Optimization Theory and Applications | 2013-09-23 | Paper |
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
Computational Optimization and Applications | 2013-02-18 | Paper |
An extension of the elimination method for a sparse SOS polynomial
Journal of the Operations Research Society of Japan | 2012-12-08 | Paper |
A facial reduction algorithm for finding sparse SOS representations
Operations Research Letters | 2010-12-20 | Paper |
| scientific article; zbMATH DE number 5564089 (Why is no real title available?) | 2009-06-11 | Paper |
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
Computational Optimization and Applications | 2009-02-13 | Paper |
EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION
Journal of the Operations Research Society of Japan | 2008-07-11 | Paper |
| scientific article; zbMATH DE number 5239111 (Why is no real title available?) | 2008-02-22 | Paper |
An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
Mathematical Programming. Series A. Series B | 2007-05-10 | Paper |
A pivoting procedure for a class of second-order cone programming
Optimization Methods & Software | 2006-07-13 | Paper |
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
SIAM Journal on Optimization | 2006-05-30 | Paper |
An efficient support vector machine learning method with second-order cone programming for large-scale problems
Applied Intelligence | 2005-12-14 | Paper |
A unified class of directly solvable semidefinite programming problems
Annals of Operations Research | 2005-04-22 | Paper |
A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS
Journal of the Operations Research Society of Japan | 2004-01-26 | Paper |
The Gauss-Newton direction in semidefinite programming
Optimization Methods & Software | 2002-09-12 | Paper |
scientific article; zbMATH DE number 1766755 (Why is no real title available?)
Journal of the Operations Research Society of Japan | 2002-07-11 | Paper |
Primal-dual affine-scaling algorithms fail for semidefinite programming
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1372696 (Why is no real title available?) | 1999-12-01 | Paper |
Affine scaling algorithm fails for semidefinite programming
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
Mathematical Programming. Series A. Series B | 1997-01-06 | Paper |
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
Annals of Operations Research | 1996-10-24 | Paper |
Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
SIAM Journal on Optimization | 1995-11-01 | Paper |
