Abstract:
$H6&$K,:G?7$N%3%s%T%e! 9-0h7W;;) Ey$H$NM;9g$bI,MWIT2D7g$G$"$C$F [4],SDPA $J$I$N:GE,2 =
Citations
|
608
|
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
– Goemans, Williamson
- 1995
|
|
445
|
Semidefinite programming
– Vandenberghe, Boyd
- 1996
|
|
187
|
On the implementation of a (primal-dual) interior point method
– Mehrotra
- 1992
|
|
181
|
An interior-point method for semidefinite programming
– HELMBERG, RENDL, et al.
- 1996
|
|
130
|
Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices
– Kojima, Shindoh, et al.
- 1997
|
|
116
|
Primal-dual path-following algorithms for semidefinite programming
– Monteiro
- 1997
|
|
86
|
On the Nesterov-Todd direction in semidefinite programming
– Todd, Toh, et al.
- 1998
|
|
24
|
Numerical evaluation of SDPA (Semidefinite Programming Algorithm
– Fujisawa, Fukuda, et al.
- 1999
|
|
16
|
Exploiting Sparsity
– Fujisawa, Kojima, et al.
- 1997
|
|
10
|
Semi-Definite Programming for Topology Optimization of Truss under Multiple Eigenvalue Constraints
– Ohsaki, Fujisawa, et al.
- 1999
|
|
1
|
SDPA(Semidefinite Programming Algortithm
– Fujisawa, Kojima, et al.
- 1999
|
|
1
|
et al.: Linear Matrix
– Boyd
- 1994
|