( en | de | ru )

 

Disambiguation of "Kojima, Masakazu"

Author of the publication

copydeleteadd this publication to your clipboard
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems.

, , and . Math. Program., 156 (1-2): 161-187 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tomoko Kojima

Hajime Kojima

Taka Bluhme-Kojima

Gregorius-Masakazu Inugai

 

Other publications of authors with the same name

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework., , , and . SIAM J. Optimization, 11 (3): 647-674 (2001)Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method., and . SIAM J. Optimization, 12 (3): 669-691 (2002)Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity., , , and . SIAM J. Optimization, 17 (1): 218-242 (2006)PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems., , , and . Computing, 77 (4): 387-411 (2006)Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods., and . Computing, 73 (4): 329-348 (2004)A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems., , and . SIAM J. Optim., 30 (2): 1251-1273 (2020)Second order cone programming relaxation of a positive semidefinite constraint., , and . Optim. Methods Softw., 18 (5): 535-541 (2003)Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures., , and . J. Glob. Optim., 77 (3): 513-541 (2020)Semidefinite programming relaxations for sensor network localization., and . CACSD, page 19-23. IEEE, (2010)A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems., , and . Math. Program., 156 (1-2): 161-187 (2016)