scientific article; zbMATH DE number 1306968
From MaRDI portal
Publication:4252814
zbMath0928.65068MaRDI QIDQ4252814
Claudia A. Sagastizábal, Regina Sandra Burachik, Benar Fux Svaiter
Publication date: 13 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Monotone operators and generalizations (47H05) Numerical solutions to equations with nonlinear operators (65J15)
Related Items (23)
A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ The relevance of convex analysis for the study of monotonicity ⋮ A new inertial-type hybrid projection-proximal algorithm for monotone inclusions ⋮ On Bregman-type distances for convex functions and maximally monotone operators ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators ⋮ On a sufficient condition for equality of two maximal monotone operators ⋮ Projective method of multipliers for linearly constrained convex minimization ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ An additive subfamily of enlargements of a maximally monotone operator ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators ⋮ Natural closures, natural compositions and natural sums of monotone operators ⋮ Enlargements and sums of monotone operators ⋮ Robustness of the hybrid extragradient proximal-point algorithm. ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ Enlargements of positive sets ⋮ A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis ⋮ Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions ⋮ An inexact ADMM with proximal-indefinite term and larger stepsize
This page was built for publication:
