16 citations · 32 across the 24 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.OC2014
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…
math.OC2014★ 3 cited
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,…
math.OC2014★ 4 cited
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.