, Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Primal-Dual Path-Following Algorithms for Semidefinite Programming - Monteiro (1996) (90 citations) (Correct)
....algorithms can also be transformed into an algorithm for SDP in a mechanical way. Since then several authors have proposed interior point algorithms for solving SDP problems including Helmberg, Rendl, Vanderbei and Wolkowicz [5] Jarre [8] Kojima, Shindoh and Hara [11] Nesterov and Nemirovskii [16], Nesterov and Todd [19, 18] and Vandenberghe and Boyd [20] Among the above works, Kojima, Shindoh and Hara [11] and Nesterov and Todd [18] present some algorithms which extend the primal dual methods for linear programming based on the scaling X 1=2 S Gamma1=2 . In particular, they both ....
, Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990.
Polynomial Convergence of a New Family of Primal-Dual.. - Monteiro, Tsuchiya (1998) (15 citations) (Correct)
.... and Overton [2] Freund [3] Helmberg, Rendl, Vanderbei and Wolkowicz [4] Jarre [5] Kojima, Shida and Shindoh [8] Kojima, Shindoh and Hara [11] Lin and Saigal [12] Luo, Sturm and Zhang [13] Monteiro [15, 16] Monteiro and Tsuchiya [19] Monteiro and Zhang [21] Nesterov and Nemirovskii [24], Nesterov and Todd [26, 27] Potra and Sheng [28] Sturm and Zhang [30] Tseng [35] Vandenberghe and Boyd [36] and Zhang [38] Most of these more recent works are concentrated on primal dual methods. The first algorithms for SDP which are extensions of well known primal dual LP algorithms, such ....
, Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990.
Polynomial Convergence of Primal-Dual Algorithms for.. - Monteiro (1997) (30 citations) (Correct)
.... including Alizadeh, Haeberly and Overton [2, 3] Freund [4] Helmberg, Rendl, Vanderbei and Wolkowicz [5] Jarre [7] Kojima, Shida and Shindoh [10, 12] Kojima, Shindoh and Hara [13] Lin and Saigal [14] Lou, Sturm and Zhang [15] Monteiro [17] Monteiro and Zhang [21] Nesterov and Nemirovskii [24], Nesterov and Todd [26, 27] Potra and Sheng [28] Sturm and Zhang [29] Tseng [31] Vandenberghe and Boyd [32] and Zhang [34] Most of these more recent works are concentrated on primal dual methods. The first SDP algorithms that are extensions of primal dual LP algorithms, such as the longstep ....
, Optimization over positive semidefinite matrices: Mathematical background and user's manual, Technical report, Central Economic & Mathematical Institute, USSR Acad. Sci. Moscow, USSR, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC