Abdo Y. Alfakih  Home/Search
Context Related
| cst.uwaterloo.ca/j/AYCOMP99.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cst.uwaterloo.ca/pub_jour (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (IgDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (IgDM). In this paper, we follow the successful approach in [20] and solve the IgDMCP 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)
Cited by: More
Robust Semidefinite Programming Approaches for Sensor Network - Localization With Anchors (Correct)
Euclidean Distance Matrices - And The Molecular (Correct)
On Least Squares Euclidean Distance Matrix - Approximation And Completion (Correct)
Similar documents (at the sentence level):
63.4%: Solving Euclidean Distance Matrix Completion Problems Via.. - Alfakih, al. (1997) (Correct)
62.9%: Small Journal Name, ?, 1--18 (199?) - Solving Euclidean Distance (Correct)
Active bibliography (related documents): More All
2.6: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.7: Approximate and Exact Completion Problems for Euclidean.. - Suliman Al-Homidan Henry (Correct)
0.7: On the Embeddability of Weighted Graphs in Euclidean Spaces - Alfakih, Wolkowicz (1998) (Correct)
Similar documents based on text: More All
0.7: Semidefinite Programming for Discrete Optimization and.. - Wolkowicz, Anjos (2000) (Correct)
0.7: A Study of Jet Production Rates in the Four Flavor .. - Balest, Cho.. (1994) (Correct)
0.6: An Interior-Point Method For Approximate Positive.. - Johnson, Kroschel.. (1997) (Correct)
Related documents from co-citation: More All
7: Distance geometry and molecular conformation (context) - Crippen, Havel - 1988
7: The Molecule Problem: Exploiting Structure in Global Optimization - Hendrickson - 1995
7: Embeddability of weighted graphs in k-space is strongly NP-hard (context) - Saxe - 1979
BibTeX entry: (Update)
A. Y. ALFAKIH, A. KHANDANI, and H. WOLKOWICZ. Solving Euclidean distance matrix completion problems via semidefinite programming. Technical report, CORR 97-9, Dept. of combinatorics and optimization, University of Waterloo, 1997. http://citeseer.ist.psu.edu/alfakih97solving.html More
@article{ alfakih99solving,
author = "Abdo Y. Alfakih and Amir Khandani and Henry Wolkowicz",
title = "Solving {E}uclidean distance matrix completion problems via semidefinite programming",
journal = "Comput. Optim. Appl.",
volume = "12",
number = "1-3",
pages = "13--30",
year = "1999",
url = "citeseer.ist.psu.edu/alfakih97solving.html" }
Citations (may not include all citations):708 Cambridge University Press (context) - HORN, JOHNSON - 1985
276 Semidefinite programming - VANDENBERGHE, BOYD - 1996
230 Interior point methods in semidefinite programming with appl.. - ALIZADEH - 1995
186 Primal-Dual Interior-Point Methods (context) - WRIGHT - 1996
173 An interior point method for semidefinite programming and ma.. - HELMBERG - 1994
65 Interior Point Algorithms: Theory and Analysis (context) - YE - 1997
44 An algorithmic analysis of multiquadratic and semidefinite p.. (context) - RAMANA - 1993
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
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
14 Distance geometry optimization for protein structures (context) - MOR, Wu - 1997
13 Properties of Euclidean and non-Euclidean distance matrices (context) - GOWER - 1985
12 Distance matrix completion by numerical optimization - TROSSET - 1997
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
10 Computing distances between convex sets and subsets of the p.. - TROSSET - 1997
8 the embeddability of weighted graphs in Euclidean spaces - ALFAKIH, WOLKOWlCZ - 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 Circum-Euclidean distance matrices and faces (context) - TARAZAGA, HAYDEN et al. - 1996
6 Interior point methods for semidefinite programming (context) - DE KLERK - 1997
5 Hybrid methods for optimization problems with positive semid.. (context) - AL-HOMIDAN - 1993
5 Hybrid methods for finding the nearest Euclidean distance ma.. (context) - AL-HOMIDAN, FLETCHER - 1995
5 Three theorems with applications to Euclidean distance matri.. (context) - FAREBROTHER - 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 the best Euclidean fit to a distance matrix (context) - ZHANCI - 1987
4 stochasticperturbation global optimization algorithm distanc.. - BYRD, perturbation et al. - 1996
1 Semidefinite programming in combinatorial optimization (context) - CIOEMANS - 1997
1 American Mathematical Society Providence R (context) - CIOL'STEIN, Convex - 1972
1 CombinatoriaI Matrix Theory (context) - BRUALDI, RYSER - 1991
1 Wiley New York (context) - CRIPPEN, HAVEL et al. - 1988
1 Cone programming and eigenvaIue optimization: geometry and a.. (context) - PATAKI - 1996
1 On certain linear mappings between inner-product and squared.. (context) - CR - 1988
1 Some applications of optimization in matrix theory (context) - WOLKOWlCZ - 1981
1 Handbook of Statistics (context) - J'DE LEEUW, scaling'In - 1982
1 A tour d'horizon on positive semideflnite and Euclidean dist.. (context) - LAURENT - 1998
1 An interior point method for semideflnite programming (context) - HELMBERG, RENDL et al. - 1996
1 The Gauss-Newton direction in linear and semideflnite progra.. (context) - KRUK, MURAMATSU et al. - 1998
1 Connections between the real positive semideflnite and dista.. (context) - JOHNSON, TARAZAGA - 1995
1 Technical report Rice Unversity Houston Texas (context) - TROSSET - 1997
1 CombinatoriaI optimization with interior point methods and s.. (context) - ALIZADEH - 1991
1 Technical Report TR1997-734 Courant Institute of Mathematica.. (context) - ALIZADEH, HAEBERLY et al. - 1997
1 Interior Point Polynomial Algorithms in Convx Programming (context) - NESTEROV, NEMIROVSKI - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cst.uwaterloo.ca/pub_jour.html): More
Shaping of Multidimensional Signal Constellations Using a.. - Khandani, Kabal (Correct)
Linear (zero-One) Programming Approach to Fixed-Rate.. - Khandani (Correct)
Combined Source-Channel Coding for the Transmission of Still.. - Iun, Khandani (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