-
2
-
-
0003728995
-
-
School of Mathematics, Georgia Tech., Atlanta, Georgia 30332, USA.
-
S. Burer, R. D. C. Monteiro and Y. Zhang (1999). Solving semidefinite programs via nonlinear programming part I: Transformations and derivatives, School of Mathematics, Georgia Tech., Atlanta, Georgia 30332, USA.
-
(1999)
Solving Semidefinite Programs Via Nonlinear Programming Part I: Transformations and Derivatives
-
-
Burer, S.1
Monteiro, R.D.C.2
Zhang, Y.3
-
3
-
-
0035238840
-
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
-
M. Fukuda, M. Kojima, K. Murota and K. Nakata (2001). Exploiting sparsity in semidefinite programming via matrix completion I: General framework. SIAM Journal on Optimization, 11(3), 647-674.
-
(2001)
SIAM Journal on Optimization
, vol.11
, Issue.3
, pp. 647-674
-
-
Fukuda, M.1
Kojima, M.2
Murota, K.3
Nakata, K.4
-
4
-
-
0034415006
-
A spectral bundle method for semidefinite programming
-
C. Helmberg and F. Rendl (2000). A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
-
(2000)
SIAM Journal on Optimization
, vol.10
, pp. 673-696
-
-
Helmberg, C.1
Rendl, F.2
-
5
-
-
0036455609
-
Second order cone programming relaxations of quadratic optimization problems
-
S. Kim and M. Kojima (2001). Second order cone programming relaxations of quadratic optimization problems. Optimization Methods and Software, 15, 201-224.
-
(2001)
Optimization Methods and Software
, vol.15
, pp. 201-224
-
-
Kim, S.1
Kojima, M.2
-
6
-
-
3242780054
-
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations
-
Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152-8552, Japan, to appear in Computational Optimization and Applications
-
S. Kim and M. Kojima (2002). Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Research Report B-375, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo 152-8552, Japan, to appear in Computational Optimization and Applications.
-
(2002)
Research Report
, vol.B-375
-
-
Kim, S.1
Kojima, M.2
-
7
-
-
0242592654
-
A general framework for convex relaxation of polynomial optimization problems over cones
-
M. Kojima, S. Kim and H. Waki (2003). A general framework for convex relaxation of polynomial optimization problems over cones. Journal of Operation Research Society of Japan, 46(2), 125-144.
-
(2003)
Journal of Operation Research Society of Japan
, vol.46
, Issue.2
, pp. 125-144
-
-
Kojima, M.1
Kim, S.2
Waki, H.3
-
8
-
-
0041940559
-
Applications of second-order cone programming
-
Special Issue on Linear Algebra in Control, Signals and Image Processing.
-
M. Lobo, L. Vandenberghe, S. Boyd and H. Lebret (1998). Applications of second-order cone programming. Linear Algebra and its Applications, 284 193-228, Special Issue on Linear Algebra in Control, Signals and Image Processing.
-
(1998)
Linear Algebra and its Applications
, vol.284
, pp. 193-228
-
-
Lobo, M.1
Vandenberghe, L.2
Boyd, S.3
Lebret, H.4
-
9
-
-
0242324790
-
A new second order cone programming relaxation for Max-cut problems
-
M. Muramatsu and T. Suzuki (2003). A new second order cone programming relaxation for Max-cut problems. Journal of Operation Research Society of Japan, 46(2), 164-177.
-
(2003)
Journal of Operation Research Society of Japan
, vol.46
, Issue.2
, pp. 164-177
-
-
Muramatsu, M.1
Suzuki, T.2
|