Finitely convergent algorithm for nonconvex inequality problems

Abstract

We extend Fukushima's result on the finite convergence of an algorithm for the global convex feasibility problem to the local nonconvex case.

Added a figure to explain an inequality. Added elaboration of sublinear. Corrected some typos

Cited by in corpus (2)

• Nonconvex set intersection problems: From projection methods to the Newton method for super-regular sets
• On the finite convergence of a projected cutter method