See this document in CiteSeerX!

Small Journal Name, ?, 1-18 (199?)  (Make Corrections)  
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite...



  Home/Search   Context   Related

 
View or download:
orion.math.uwaterloo.ca/~h...distmat.ps
orion.uwaterloo.ca/pub/...distmat.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  orion.math.uwaterloo.ca/~hwolk... (more)
From:  zib.de/helmberg/semidef
(Enter author homepages)

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

Abstract: Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM). In this paper, we follow the successful approach in [20] and solve the EDMCP by generalizing the completion problem to allow for approximate completions. In particular, we introduce a primal-dual interior-point algorithm that solves an equivalent (quadratic objective function)... (Update)

Similar documents (at the sentence level):
66.3%:   Solving Euclidean Distance Matrix Completion Problems Via.. - Alfakih (1997)   (Correct)

Active bibliography (related documents):   More   All
3.3:   Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)   (Correct)
1.1:   Approximate and Exact Completion Problems for Euclidean.. - Suliman Al-Homidan Henry   (Correct)
1.1:   On the Embeddability of Weighted Graphs in Euclidean Spaces - Alfakih, Wolkowicz (1998)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ distance-small,
  author = "Solving Euclidean Distance",
  title = "Small Journal Name, ?, 1--18 (199?)",
  url = "citeseer.ist.psu.edu/764119.html" }
Citations (may not include all citations):
708   Cambridge University Press (context) - HORN, JOHNSON - 1985
326   Interior Point Polynomial Algorithms in Convex Programming (context) - NESTEROV, NEMIROVSKI - 1994
276   Semidefinite programming - VANDENBERGHE, BOYD - 1996  ACM
230   Interior point methods in semidefinite programming with appl.. - ALIZADEH - 1995
186   Primal-Dual Interior-Point Methods (context) - WRIGHT - 1996  ACM
173   An interior point method for semidefinite programming - HELMBERG, RENDL et al. - 1996
173   An interior point method for semidefinite programming and ma.. - HELMBERG - 1994
65   Interior Point Algorithms: Theory and Analysis (context) - YE - 1997
60   Combinatorial optimization with interior point methods and s.. (context) - ALIZADEH - 1991
52   Distance Geometry and Molecular Conformation (context) - CRIPPEN, HAVEL - 1988
49   Semidefinite programming in combinatorial optimization - GOEMANS - 1997  ACM
44   An algorithmic analysis of multiquadratic and semidefinite p.. (context) - RAMANA - 1993  ACM
41   Combinatorial Matrix Theory (context) - BRUALDI, RYSER - 1991
35   Some applications of optimization in matrix theory (context) - WOLKOWICZ - 1981
34   Theory and method (context) - TORGERSON - 1952
31   On search directions in interior-point methods for semidefin.. (context) - TODD - 1997
23   Global continuation for distance geometry problems (context) - MOR, Wu - 1996  ACM
21   Primal-dual interior point approach to semidefinite programm.. (context) - STURM - 1997
20   An interior-point method for approximate positive semidefini.. - JOHNSON, KROSCHEL et al. - 1998
17   Positive definite programming (context) - VANDENBERGHE, BOYD - 1994
15   On certain linear mappings between inner-product and squared.. (context) - CRITCHLEY - 1988
14   Distance geometry optimization for protein structures (context) - MOR, Wu - 1997
14   American Mathematical Society (context) - GOL'STEIN, Convex - 1972
13   Properties of Euclidean and non-Euclidean distance matrices (context) - GOWER - 1985
12   Distance matrix completion by numerical optimization - TROSSET - 1997  ACM
12   The Gauss-Newton direction in linear and semidefinite progra.. (context) - KRUK, MURAMATSU et al. - 1998
12   The Euclidean distance matrix completion problem (context) - BAKONYI, JOHNSON - 1995
12   An alternating projection algorithm for computing the neares.. (context) - GLUNT, HAYDEN et al. - 1990  ACM
11   Theory of multidimensional scaling (context) - DE LEEUW, HEISER - 1982
10   Applications of multidimensional scaling to molecular confor.. - TROSSET - 1997
10   Computing distances between convex sets and subsets of the p.. - TROSSET - 1997
10   Courant Institute of Mathematical Sciences (context) - ALIZADEH, HAEBERLY et al. - 1997
10   Connections between the real positive semidefinite and dista.. (context) - JOHNSON, TARAZAGA - 1995
9   Cone programming and eigenvalue optimization: geometry and a.. (context) - PATAKI - 1996
9   A tour d'horizon on positive semidefinite and Euclidean dist.. (context) - LAURENT - 1998
8   the embeddability of weighted graphs in Euclidean spaces - ALFAKIH, WOLKOWICZ - 1998
8   Remarks to Maurice Frechet's article: Sur la definition axio.. (context) - SCHOENBERG - 1935
6   The cone of distance matrices (context) - HAYDEN, WELLS et al. - 1991
6   Interior point methods for semidefinite programming (context) - DE KLERK - 1997
6   Circum-Euclidean distance matrices and faces (context) - TARAZAGA, HAYDEN et al. - 1996
5   Three theorems with applications to Euclidean distance matri.. (context) - FAREBROTHER - 1987
5   Hybrid methods for finding the nearest Euclidean distance ma.. (context) - AL-HOMIDAN, FLETCHER - 1995
5   Hybrid methods for optimization problems with positive semid.. (context) - AL-HOMIDAN - 1993
4   the best Euclidean fit to a distance matrix (context) - ZHANG - 1987
4   Differential stability in infinite-dimensional nonlinear pro.. (context) - LEMPIO, MAURER - 1980
4   estimation of mean form and mean form difference (context) - LELE, matrix et al. - 1993
4   stochasticperturbation global optimization algorithm distanc.. - BYRD, perturbation et al. - 1996
ftp://orion.uwaterloo.ca/pub/henry/reports/distmat.ps.gz

Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/reports/):   More
Regularization Using a - Parameterized Trust Region   (Correct)
A Matrix-lifting Semidefinite Relaxation for the Quadratic.. - Yichuan Ding Henry   (Correct)
Semidefinite Programming - Henry Wolkowicz October   (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