1 citations · 1 across the 1 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2025★ 1 cited
Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility
Thi Lan Dinh, G. S. Matthijs Jansen, D. Russell Luke
We study the cyclic relaxed Douglas-Rachford algorithm for possibly nonconvex, and inconsistent feasibility problems. This algorithm can be viewed as a convex relaxation between th…
math.OC2025
Algorithmic approaches to avoiding bad local minima in nonconvex inconsistent feasibility
Thi Lan Dinh, Wiebke Bennecke, G. S. Matthijs Jansen +2
We report on the use of algorithms to avoid or move away from ``bad'' local minima in nonconvex optimization. Our study is phenomenological and empirical, focusing on the performan…