A proximal iterative approach to a non-convex optimization problem - Université des Antilles
Journal Articles Nonlinear Analysis: Theory, Methods and Applications Year : 2010

A proximal iterative approach to a non-convex optimization problem

Abstract

We consider a variable Krasnosel'skii-Mann algorithm for approximating critical points of a prox-regular function or equivalently for finding fixed-points of its proximal mapping proxλf. The novelty of our approach is that the latter is not non-expansive any longer. We prove that the sequence generated by such algorithm (via the formula xk+1=(1−αk)xk+αkproxλkfxk, where (αk) is a sequence in (0,1)), is an approximate fixed-point of the proximal mapping and converges provided that the function under consideration satisfies a local metric regularity condition.

Dates and versions

hal-00778175 , version 1 (18-01-2013)

Identifiers

Cite

Abdellatif Moudafi. A proximal iterative approach to a non-convex optimization problem. Nonlinear Analysis: Theory, Methods and Applications, 2010, 72 (2), pp.704-709. ⟨10.1016/j.na.2009.07.011⟩. ⟨hal-00778175⟩

Collections

UNIV-AG TDS-MACS
92 View
0 Download

Altmetric

Share

More