11 papers · ranked by Valyu relevance
C. H. Jeffrey Pang
| 1. | Introduction | 1 | | --- | --- | --- | | 2. | The case of one set | 2 | | 3. | Preliminaries from [Pan18c] | 4 | | 4. | Proof of convergence | 11 | | 5. | Numerical experiments | 15 | | References | | 17 |
C. H. Jeffrey Pang
We consider the best approximation problem (BAP) of projecting a point onto the intersection of a number of convex sets. It is known that Dykstra's algorithm is alternating minimization on the dual problem. We extend Dykstra's algorithm so that it can be enhanced by the SHQP strategy of using quadratic programming to…
C. H. Jeffrey Pang
We show a general framework of parallelizing Dykstra splitting that includes the classical Dykstra's algorithm and the product space formulation as special cases, and prove their convergence. The key idea is to split up the function whose conjugate takes in the sum of all dual variables in the dual formulation.
Qi Wei, José M. Bioucas‐Dias, Nicolas Dobigeon, Jean–Yves Tourneret
—This paper presents a fast spectral unmixing algorithm based on Dykstra's alternating projection. The proposed algorithm formulates the fully constrained least squares optimization problem associated with the spectral unmixin g task as an unconstrained regression problem followed by a projection onto the intersection…
Matthew Chou
We consider the problem of finding a "fair" meeting place when S people want to get together. Specifically, we will consider the cases where a "fair" meeting place is defined to be either 1) a node on a graph that minimizes the maximum time/distance to each person or 2) a node on a graph that minimizes the sum of…
Abhishek Patil, Jungyun Bae, Myoungkuk Park, Andrey V. Savkin
This paper proposes an algorithm that provides operational strategies for multiple heterogeneous mobile robot systems utilized in many real-world applications, such as deliveries, surveillance, search and rescue, monitoring, and transportation. Specifically, the authors focus on developing an algorithm that solves a…
Jungyun Bae, Woojin Chung
A solution to the multiple depot heterogeneous traveling salesman problem with a min-max objective is in great demand with many potential applications of unmanned vehicles, as it is highly related to a reduction in the job completion time. As an initial idea for solving the min-max multiple depot heterogeneous…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
Zuxi Chen, ShiFan Zhang, XianLi Zeng, Meng Mei + 3 more
'Lixiao Zheng' 'Sedat Akleylek'] This article presents a novel parallel path detection algorithm for identifying suspicious fraudulent accounts in large-scale banking transaction graphs. The proposed algorithm is based on a three-step approach that involves constructing a directed graph, shrinking strongly connected…
Pier Paolo Poir, Louis Lagardère, Jean-Philip Piquemal
We propose a new strategy to solve the Tkatchenko-Scheffler Many-Body Dispersion (MBD) model’s equations. Our approach overcomes the original O(N**3) computational complexity that limits its applicability to large molecular systems within thecontext of O(N) Density Functional Theory (DFT). First, in order to generate…
Cheryl R. Dykstra, William T. Route, Kelly A. Williams
We analyzed concentrations and trends of perfluoroalkyl substances (PFAS) in blood plasma samples of bald eagle (Haliaeetus*leucocephalus) nestlings at 6 study areas in the upper Midwest of the United States, 2006 to 2015, and long-term trends at 2 Lake Superior (USA/Canada) sites, 1995 to 2015. Nestling blood plasma…