4 citations · 10 across the 5 of their papers we have counts for
5 papers
On Inexact Accelerated Proximal Gradient Methods with Relative Error Rules
Yunier Bello-Cruz, Max L. N. Gonçalves, Nathan Krislock
One of the most popular and important first-order iterations that provides optimal complexity of the classical proximal gradient method (PGM) is the "Fast Iterative Shrinkage/Thres…
Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier
Dmitriy Drusvyatskiy, Nathan Krislock, Yuen-Lam Voronin +1
We present two algorithms for large-scale low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in…
Resolving Histogram Binning Dilemmas with Binless and Binfull Algorithms
Abram Krislock, Nathan Krislock
The histogram is an analysis tool in widespread use within many sciences, with high energy physics as a prime example. However, there exists an inherent bias in the choice of binni…
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
Nathan Krislock, Henry Wolkowicz
The sensor network localization, SNL, problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are wi…
Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization
Yichuan Ding, Nathan Krislock, Jiawei Qian +1
We study Semidefinite Programming, \SDPc relaxations for Sensor Network Localization, \SNLc with anchors and with noisy distance information. The main point of the paper is to view…