E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, ser. Applied Optimization. Kluwer Academic Publishers, March 2002, vol. 65. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Limiting Behavior of the Central Path in Semidefinite.. - Halicka, de Klerk, Roos (2002) Self-citation (De klerk) (Correct)
....proofs for linear optimization cannot be extended to SDO. 4 The central path as a set of analytic centers In this section we analyze another approach which uses the fact that for any 0 the central path X( S( y( is the analytic center of the level set of the duality gap (see e.g. [6], Lemma 3.3) This 8 means that (X( Z( y( is a solution to the problem ln det X ln det Z : A . i = 1, m) 30) We first observe that this problem can be separated into two problems that yield the primal and dual centers respectively: X#S ....
E. de Klerk. Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Applied Optimization Series 65, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002.
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, ser. Applied Optimization. Kluwer Academic Publishers, March 2002, vol. 65.
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
No context found.
E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, ser. Applied Optimization. Kluwer Academic Publishers, March 2002, vol. 65.
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