Euclidean Distance Matrices and Applications
In: Handbook on Semidefinite, Conic and Polynomial Optimization
Author
Abstract
Suggested Citation
DOI: 10.1007/978-1-4614-0769-0_30
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Xin Shen & John E. Mitchell, 2018. "A penalty method for rank minimization problems in symmetric matrices," Computational Optimization and Applications, Springer, vol. 71(2), pages 353-380, November.
- Marcin Bukowski & Janusz Majewski & Agnieszka Sobolewska, 2023. "The Environmental Impact of Changes in the Structure of Electricity Sources in Europe," Energies, MDPI, vol. 16(1), pages 1-22, January.
- Varvitsiotis, A., 2013. "Combinatorial conditions for low rank solutions in semidefinite programming," Other publications TiSEM d0fcc572-daaf-4bd9-95db-1, Tilburg University, School of Economics and Management.
- Nathanaël Randriamihamison & Nathalie Vialaneix & Pierre Neuvial, 2021. "Applicability and Interpretability of Ward’s Hierarchical Agglomerative Clustering With or Without Contiguity Constraints," Journal of Classification, Springer;The Classification Society, vol. 38(2), pages 363-389, July.
More about this item
Keywords
Chordal Graph; Unit Disk Graph; Completion Problem; Euclidean Distance Matrix; Principal Submatrix;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:isochp:978-1-4614-0769-0_30. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.