Coupling proximal methods and variational convergence

DOI10.1007/BF01416609zbMath0789.49020MaRDI QIDQ4277995

Abdellatif Moudafi

Publication date: 12 June 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

maximal monotone operatorapproximation methodreal Hilbert spacevariational convergencedata perturbationpartial inverse methodproximinal point algorithm

Mathematics Subject Classification ID

Nonsmooth analysis (49J52)

Related Items (6)

Fast Moreau envelope computation I: Numerical algorithms ⋮ On the convergence of the proximal algorithm for saddle-point problems ⋮ Application of the penalty method to nonstationary approximation of an optimization problem ⋮ A reflected inertial Krasnoselskii-type algorithm for Lipschitz pseudo-contractive mappings ⋮ A new perturbed algorithm for generalized quasi-variational inclusions ⋮ Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• Penalty-proximal methods in convex programming
• Monotone (nonlinear) operators in Hilbert space
• Penalization in non-classical convex programming via variational convergence
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Applications of the method of partial inverses to convex programming: Decomposition
• Quantitative Stability of Variational Systems: I. The Epigraphical Distance
• Monotone Operators and the Proximal Point Algorithm
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

This page was built for publication: Coupling proximal methods and variational convergence