See this document in CiteSeerX!

Complementarity and Nondegeneracy in Semidefinite Programming (1995)  (Make Corrections)  (47 citations)
Farid Alizadeh Jean-Pierre A. Haeberly Michael L. Overton March 1995...



  Home/Search   Context   Related

 
View or download:
de/pub/languages/nyu.edu/...tr681.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  de/pub/languages/nyu.ed...reports (more)
(Enter author homepages)

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

Abstract: Primal and dual nondegeneracy conditions are defined for semidefinite programming. Given the existence of primal and dual solutions, it is shown that primal nondegeneracy implies a unique dual solution and that dual nondegeneracy implies a unique primal solution. The converses hold if strict complementarity is assumed. Primal and dual nondegeneracy assumptions do not imply strict complementarity, as they do in LP. The primal and dual nondegeneracy assumptions imply a range of possible ranks for ... (Update)

Context of citations to this paper:   More

...side of (2.10) under nondegeneracy assumptions. To do this, we use the notions of nondegeneracy that were introduced by the authors in [3]. DEFINITION 1. Let (X,y,Z) solve (1.2) 1.3) with an orthogonal matrix Q satisfying (1.9) LetX have rank r, with positive eigenvalues #...

...(X # , y # , Z # ) of the primal and dual SDP. If (X # , Z # ) satisfies the strict complementarity condition defined in [1] (that is, rank(X # ) rank(Z # ) n) then as (X, Z) approaches this optimal solution (i.e. when is su#ciently small) the eigenvalues of W will...

Cited by:   More
Semidefinite Programming - Vandenberghe, Boyd (1995)   (Correct)
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)   (Correct)
Conditioning of Semidefinite Programs - Nayakkankuppam, Overton (1999)   (Correct)

Similar documents (at the sentence level):
44.0%:   Complementarity and Nondegeneracy in Semidefinite.. - Alizadeh, Haeberly, Overton (1997)   (Correct)

Active bibliography (related documents):   More   All
0.0:   Measures on Corson Compact Spaces - Kenneth Kunen   (Correct)
0.0:   A Notation for Lambda Terms: A Generalization of Environments - Nadathur, Wilson (1994)   (Correct)
0.0:   A Notation for Lambda Terms I: A Generalization of Environments - Nadathur, Wilson (1994)   (Correct)

Similar documents based on text:   More   All
0.6:   Nondegeneracy of Polyhedra and Linear Programs - Wang, Monteiro (1995)   (Correct)
0.5:   Trust Region Affine Scaling Algorithms for Linearly.. - Monteiro, Wang (1996)   (Correct)
0.5:   Equivalence and the Cartan Form - Olver (1993)   (Correct)

Related documents from co-citation:   More   All
34:   Primal-dual interior-point methods for semidefinite programming - Alizadeh, Haeberly et al. - 1994
31:   An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
28:   Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995

BibTeX entry:   (Update)

W. F. Alizadeh, J. -P. A. Haeberly and M. L. Overton, , "Complementarity and Nondegeneracy in Semidefinite Programming," Working Paper, 1995. http://citeseer.ist.psu.edu/article/alizadeh95complementarity.html   More

@techreport{ alizadeh95complementarity,
    author = "F. Alizadeh and J.--P. A. Haeberly and M. L. Overton",
    title = "Complementarity and nondegeneracy in semidefinite programming",
    address = "New Brunswick, NJ~08903, USA",
    year = "1995",
    url = "citeseer.ist.psu.edu/article/alizadeh95complementarity.html" }
Citations (may not include all citations):
52   On matrices depending on parameters (context) - Arnold - 1971
38   Linear programming in infinite dimensional spaces (context) - Anderson, Nash - 1987
14   Van Nostrand Company (context) - Halmos - 1950
1   Interior Point Polynomial Algorithms (context) - Nesterov, Nemirovskii



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://ftp.gwdg.de/pub/languages/nyu.edu/tech-reports/reports.html):   More
Closed Hashing is Computable and Optimally Randomizable with.. - Siegel, Schmidt   (Correct)
Preconditioners for Indefinite Problems - Klawonn (1995)   (Correct)
On the Singular Limit of the Quantum-Classical Molecular.. - Bornemann, Schütte (1996)   (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