Degenerate Preconditioned Proximal Point Algorithms as Forward Methods for Nonmonotone Inclusions

We study degenerate preconditioned proximal point algorithms (PPPA) for finding zeros of nonmonotone set-valued operators in Hilbert spaces under solution-relative $(U,V)$-semimonotonicity, with possibly indefinite $U$ and $V$. With a closed-range preconditioner $P$, the reduced PPPA dynamics admit a forward representation through the complementary resolvent of a parallel composition, without requiring monotonicity or admissibility. Relative semimonotonicity of the range-restricted operator transfers to the reduced forward map, allowing our forward theory for possibly set-valued mappings to yield Fejér estimates and residual rates. Under suitable conditions, including demiclosedness of the reduced map at zero, the projected PPPA iterates and shadows converge weakly to a common projected zero. Without demiclosedness, a counterexample shows that the projected sequences may converge to a point outside the projected zero set, even when the original operator is continuous. Bounded recovery condition yields weak convergence of the full (non-projected) shadows. The monotonicity modulus $U$ yields additional results: under suitable conditions, $U\succeqτP$ with $τ>0$ gives strong and linear convergence of the projected PPPA sequences, while $U\succeq-σP$ with $0\leσ<1/2$ still permits local linear rates under metric subregularity. These strong convergence and linear rate guarantees extend to the full shadows when a Lipschitz recovery estimate holds, such as when $U$ is strongly monotone on $\ker P$. For Chambolle--Pock and Douglas--Rachford splitting, we establish Lipschitz recovery even when $U=0$ by exploiting the primal--dual structure. Under suitable parameter conditions, full-shadow convergence guarantees, including $R$-linear rates, extend to the original PPPA iterates.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20523
Primary Topic
Optimization and Variational Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Degenerate Preconditioned Proximal Point Algorithms as Forward Methods for Nonmonotone Inclusions

Jan Harold Alcantara
arXiv (Cornell University)
Optimization and Variational Analysis
preprint

Degenerate Preconditioned Proximal Point Algorithms as Forward Methods for Nonmonotone Inclusions

Jan Harold Alcantara
preprint en

Abstract

We study degenerate preconditioned proximal point algorithms (PPPA) for finding zeros of nonmonotone set-valued operators in Hilbert spaces under solution-relative $(U,V)$-semimonotonicity, with possibly indefinite $U$ and $V$. With a closed-range preconditioner $P$, the reduced PPPA dynamics admit a forward representation through the complementary resolvent of a parallel composition, without requiring monotonicity or admissibility. Relative semimonotonicity of the range-restricted operator transfers to the reduced forward map, allowing our forward theory for possibly set-valued mappings to yield Fejér estimates and residual rates. Under suitable conditions, including demiclosedness of the reduced map at zero, the projected PPPA iterates and shadows converge weakly to a common projected zero. Without demiclosedness, a counterexample shows that the projected sequences may converge to a point outside the projected zero set, even when the original operator is continuous. Bounded recovery condition yields weak convergence of the full (non-projected) shadows. The monotonicity modulus $U$ yields additional results: under suitable conditions, $U\succeqτP$ with $τ>0$ gives strong and linear convergence of the projected PPPA sequences, while $U\succeq-σP$ with $0\leσ<1/2$ still permits local linear rates under metric subregularity. These strong convergence and linear rate guarantees extend to the full shadows when a Lipschitz recovery estimate holds, such as when $U$ is strongly monotone on $\ker P$. For Chambolle--Pock and Douglas--Rachford splitting, we establish Lipschitz recovery even when $U=0$ by exploiting the primal--dual structure. Under suitable parameter conditions, full-shadow convergence guarantees, including $R$-linear rates, extend to the original PPPA iterates.

arXiv (Cornell University)
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon