![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Nathan Krislock
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j11]José Yunier Bello Cruz
, Max L. N. Gonçalves, Nathan Krislock:
On FISTA with a relative error rule. Comput. Optim. Appl. 84(2): 295-318 (2023) - 2019
- [j10]Farid Alizadeh, Douglas Soares Gonçalves
, Nathan Krislock, Leo Liberti:
Preface. Discret. Appl. Math. 256: 1-4 (2019) - 2018
- [j9]Farid Alizadeh, Douglas Soares Gonçalves
, Nathan Krislock, Leo Liberti
:
Preface: Special issue dedicated to Distance Geometry. J. Glob. Optim. 72(1): 1-4 (2018) - 2017
- [j8]Dmitriy Drusvyatskiy, Nathan Krislock, Yuen-Lam Voronin, Henry Wolkowicz:
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier. SIAM J. Optim. 27(4): 2301-2331 (2017) - [j7]Nathan Krislock
, Jérôme Malick, Frédéric Roupin:
BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems. ACM Trans. Math. Softw. 43(4): 32:1-32:23 (2017) - 2016
- [j6]Nathan Krislock
, Jérôme Malick, Frédéric Roupin:
Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Comput. Oper. Res. 66: 153-159 (2016) - [j5]Michael P. Friedlander, Nathan Krislock, Ting Kei Pong
:
Social Resistance. Comput. Sci. Eng. 18(2): 98-103 (2016) - 2014
- [j4]Nathan Krislock, Jérôme Malick, Frédéric Roupin:
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Math. Program. 143(1-2): 61-86 (2014) - 2013
- [j3]Babak Alipanahi
, Nathan Krislock, Ali Ghodsi, Henry Wolkowicz, Logan Donaldson
, Ming Li:
Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming. J. Comput. Biol. 20(4): 296-310 (2013) - 2010
- [j2]Nathan Krislock, Henry Wolkowicz:
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions. SIAM J. Optim. 20(5): 2679-2708 (2010) - 2004
- [j1]Nathan Krislock, Jochen Lang, James M. Varah, Dinesh K. Pai, Hans-Peter Seidel:
Local compliance estimation via positive semidefinite constrained least squares. IEEE Trans. Robotics 20(6): 1007-1011 (2004)
Conference and Workshop Papers
- 2012
- [c2]Babak Alipanahi
, Nathan Krislock, Ali Ghodsi, Henry Wolkowicz, Logan Donaldson, Ming Li:
Protein Structure by Semidefinite Facial Reduction. RECOMB 2012: 1-11 - 2008
- [c1]Yichuan Ding, Nathan Krislock, Jiawei Qian, Henry Wolkowicz:
Sensor network localization, euclidean distance matrix completions, and graph realization. MELT 2008: 129-134
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint