See this document in CiteSeerX!

Motakuri Venkata Ramana  (Make Corrections)  
On the ELSD Duality Theory for SDP Robert M. Freund May 9, 1996



  Home/Search   Context   Related

 
View or download:
ufl.edu/~ramana/research/big...elsd2.ps
starnetinc.com/ramana1/resea...elsd2.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ufl.edu/~ramana/research/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Recently, a polynomial size gapfree dual, called the ELSD dual, dereived for Semidefinite Programming Problem (SDP). In this paper, some properties of the ELSD dual will be investigated. 1 Center for Applied Optimization, 303 Weil Hall, Dept. of ISE, University of Florida, Gainesville, FL 32608 2 Sloan School of Management, MIT, Cambrideg, MA 1 Introduction The primal problem of interest is: sup : c T x s.t. P m i=1 x i Q i ¯ Q 0 ; (P) where, Q 0 ; Q 1 ; ::; Qm are given real... (Update)

Similar documents (at the sentence level):
10.0%:   An Exact duality Theory for Semidefinite Programming and its .. - Motakuri Venkata   (Correct)

Active bibliography (related documents):   More   All
0.5:   Some Geometric Results in Semidefinite Programming - Ramana, Goldman (1995)   (Correct)
0.0:   General Interior-Point Maps and Existence of Weighted.. - Monteiro.. (1999)   (Correct)
0.0:   Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)   (Correct)

Similar documents based on text:   More   All
0.3:   Determination of the CKD-711 and its metabolites.. - Myung, Min, Kim..   (Correct)
0.2:   Polyhedra, Spectrahedra, and Semidefinite Programming - Ramana (1997)   (Correct)
0.2:   A Newton-like Method for Nonlinear Semidefinite Inequalities - Motakuri Ramana   (Correct)

BibTeX entry:   (Update)

@misc{ freund-motakuri,
  author = "Robert Freund",
  title = "Motakuri Venkata Ramana",
  url = "citeseer.ist.psu.edu/6232.html" }
Citations (may not include all citations):
326   Topics in matrix analysis (context) - Horn, Johnson - 1991
30   Strong Duality in Semidefinite Programming - Ramana, Tun et al. - 1995
2   An Exact Duailty Theory for Semidefinite Programming and its.. (context) - Ramana

Documents on the same site (http://www2.ise.ufl.edu/~ramana/research/index.html):   More
Continuous Characterizations of the Maximum Clique Problem - Gibbons, Hearn, Pardalos, .. (1997)   (Correct)
Congestion Toll Pricing of Traffic Networks - Bergendorff, Hearn, Ramana (1996)   (Correct)
Polyhedra, Spectrahedra, and Semidefinite Programming - Ramana (1997)   (Correct)

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