Answers are grounded in this paper and cite their sources.
Algorithmic analysis demonstrates strong convergence for generalized forward reflected backward methods without requiring Lipschitz constants, indicating improved efficiency in regression.
In this paper, we are concerned with the iterative approximation of solution to the unconstrained convex minimization problem in a real Hilbert space. Our first method is motivated by the recent advancement on the reflected backward method and the generalized reflected backward method. We also introduce a Halpern generalized reflected backward method. The method uses an increasing stepsize which eliminates the need to the Lipschitz constant of the gradient of one of the functions. We establish the weak convergence of the core Generalized Forward Reflected Backward Method (GFRB) and prove the strong convergence of the proposed Halpern Generalized Forward Reflected Backward Method (HGFRB) to a solution of the convex minimization problem. The practicability and efficiency of the method are demonstrated through a numerical example from application to the regression problem.
No takes yet. Share an insight, caveat, or question.
OLAWALE KAZEEM OYEWOLE (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: