Pages that link to "Item:Q4441938"
From MaRDI portal
The following pages link to Inexact Variants of the Proximal Point Algorithm without Monotonicity (Q4441938):
Displaying 13 items.
- A new approach to the proximal point method: convergence on general Riemannian manifolds (Q283913) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- Revisit the over-relaxed proximal point algorithm (Q311711) (← links)
- Global convergence of a proximal linearized algorithm for difference of convex functions (Q331993) (← links)
- About the relaxed cocoercivity and the convergence of the proximal point algorithm (Q392333) (← links)
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality (Q494873) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Local linear convergence of approximate projections onto regularized sets (Q654094) (← links)
- Hybrid proximal methods for equilibrium problems (Q694191) (← links)
- A Lyusternik-Graves theorem for the proximal point method (Q694520) (← links)
- On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions (Q5121447) (← links)
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings (Q5219693) (← links)
- On inexact versions of a quasi-equilibrium problem: a Cournot duopoly perspective (Q6497048) (← links)