Solving monotone inclusions with linear multi-step methods.

DOI10.1007/S10107-002-0366-2zbMATH Open1033.65051OpenAlexW2037917162MaRDI QIDQ1404232FDOQ1404232

Teemu Pennanen, B. F. Svaiter

Publication date: 20 August 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0366-2

Recommendations

• A new inertial-type hybrid projection-proximal algorithm for monotone inclusions
• New approach to relaxed proximal point algorithms based on \(A\)-maximal monotonicity frameworks and applications
• A dynamic approach to a proximal-Newton method for monotone inclusions in Hilbert spaces, with complexity \(\mathcal{O}(1/n^2)\)
• Continuous first-order methods for monotone inclusions in a Hilbert space
• Solving monotone inclusions via compositions of nonexpansive averaged operators

zbMATH Keywords

convergenceHilbert spaceset-valued mappingsteepest descent methodmonotone inclusionslinear multi-step methodsdifferential incusionproximal-like algorithms

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Ordinary differential inclusions (34A60) Set-valued and variational analysis (49J53) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cited In (4)

• Coincidence points by generalized Mann iterates with applications in Hilbert spaces
• Generalized Mann iterates for constructing fixed points in Hilbert spaces
• Composition duality principles for mixed variational inequalities
• An algorithm for finding a solution to the inclusion 0\(\in F(x)\)

This page was built for publication: Solving monotone inclusions with linear multi-step methods.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404232)