SearcharxivSearch

arXiv subjects

Aleksandr Arakcheev

Publications and source records attributed to Aleksandr Arakcheev.

2 recordsLinked to original sources

On Opial's Lemma

Opial's Lemma is a fundamental result in the convergence analysis of sequences generated by optimization algorithms in real Hilbert spaces. We introduce the concept of Opial sequences - sequences for which the limit of the distance to each point in a given set exists. We systematically derive properties of Opial sequences, contrasting them with the well-studied Fejér monotone sequences, and establish conditions for weak and strong convergence. Key results include characterizations of weak convergence via weak cluster points (reaffirming Opial's Lemma), strong convergence via strong cluster points, and the behavior of projections onto Opial sets in terms of asymptotic centers. Special cases and examples are provided to highlight the subtle differences in convergence behaviour and projection properties compared to the Fejér monotone case.

math.OC

Fejér and Fejér* Monotonicity: New Results and Limiting Examples

Many algorithms in convex optimization and variational analysis can be analyzed using Fejér monotone sequences. In 2024, Behling, Bello-Cruz, Iusem, Alves Ribeiro, and Santos introduced a new, more general, notion: Fejér* monotonicity. They obtained basic results and discussed applications in optimization. In this work, we complement Behling et al.'s work by presenting a thorough study of Fejér* monotonicity. We reveal striking similarities and differences between these notions, including descriptions of the maximal Fejér* set. Moreover, we also touch upon Opial sequences and quasi-Fejér monotonicity. Throughout this paper, we provide numerous limiting examples and counterexamples.

math.OC