4 citations · 7 across the 5 of their papers we have counts for
5 papers · 1 filter
Improving the distance reduction step in the von Neumann algorithm
C. H. Jeffrey Pang
A known first order method to find a feasible solution to a conic problem is an adapted von Neumann algorithm. We improve the distance reduction step there by projecting onto the c…
Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
C. H. Jeffrey Pang
The von Neumann-Halperin method of alternating projections converges strongly to the projection of a given point onto the intersection of finitely many closed affine subspaces. We…
Improved analysis of algorithms based on supporting halfspaces and quadratic programming for the convex intersection and feasibility problems
C. H. Jeffrey Pang
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First,…
Finitely convergent algorithm for nonconvex inequality problems
C. H. Jeffrey Pang
We extend Fukushima's result on the finite convergence of an algorithm for the global convex feasibility problem to the local nonconvex case.
First order dependence on uncertainty sets in robust optimization
C. H. Jeffrey Pang
We show that a first order problem can approximate solutions of a robust optimization problem when the uncertainty set is scaled, and explore further properties of this first order…