3 citations · 8 across the 5 of their papers we have counts for
5 papers
A general framework for parallelizing Dyskstra splitting
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 c…
Dykstra splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
C. H. Jeffrey Pang
We show that Dykstra's splitting for projecting onto the intersection of convex sets can be extended to minimize the sum of convex functions and a regularizing quadratic. We give c…
Nonasymptotic and asymptotic linear convergence of an almost cyclic SHQP Dykstra's algorithm for polyhedral problems
C. H. Jeffrey Pang
We show that an almost cyclic (or generalized Gauss- Seidel) Dykstra's algorithm which incorporates the SHQP (supporting halfspace- quadratic programming) strategy can achieve nona…
First order constrained optimization algorithms with feasibility updates
C. H. Jeffrey Pang
We propose first order algorithms for convex optimization problems where the feasible set is described by a large number of convex inequalities that is to be explored by subgradien…
Nonconvex set intersection problems: From projection methods to the Newton method for super-regular sets
C. H. Jeffrey Pang
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for c…