betaFeedback

WorksMathematics

Beyond Monotone Operators: Zarantonello-type Surjectivity Theorems and the Proximal Point Algorithm

Abstract

Outside the maximally monotone class, proximal point iterates need not exist, and their existence is usually assumed. We study the existence and convergence of inexact proximal iterates for set-valued star-monotone operators TT on real Hilbert spaces, with ⟨u,x−x∗⟩≥0\langle u,x-x^\ast\rangle\geq0 for some zero x∗x^\ast and every (x,u)(x,u) in the graph of TT. This class strictly contains monotone and pseudomonotone operators with zeros. We prove that Id+cT\mathrm{Id}+cT is surjective for every c>0c>0 under four pairwise incomparable topological frameworks, several of whose hypotheses are necessary. Surjectivity can fail under the weak Minty condition with positive violation. For star γγ-hypomonotone operators, 0<c<1/γ0<c<1/γ is the sharp range for guaranteed surjectivity. When TT is star-monotone at every zero, we give conditions for weak convergence of inexact sequences with summable errors, allowing arbitrary selections from the possibly set-valued resolvent. A counterexample exhibits nonconvergence under star monotonicity at a single zero. Under strong star monotonicity, we obtain strong convergence, including for certain nonsummable errors, and derive explicit R-linear rates. For a class of nonsmooth nonconvex–nonconcave minimax problems with star quasiconvex partial functions, every proximal step exists for every c>0c>0. In the strongly star quasiconvex case, we obtain R-linear convergence results with subproblems solved to Clarke stationarity.

Paper details

vlnc:W_wkcuce39
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…