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 (Q2322832): Difference between revisions

Latest revision as of 00:10, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	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	scientific article

Statements

instance of

scholarly article

0 references

title

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 (English)

0 references

0 references

0 references

0 references

5 September 2019

0 references

full work available at URL

https://arxiv.org/abs/1711.11551

0 references

zbMATH Keywords

inexact Douglas-Rachford method

0 references

splitting

0 references

monotone operators

0 references

HPE method

0 references

complexity

0 references

Tseng's forward-backward method

0 references

describes a project that uses

2EBD-HPE

0 references

LIBSVM

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems

0 references

A Hybrid Proximal-Extragradient Algorithm with Inertial Effects

0 references

Recent Developments on Primal–Dual Splitting Methods with Applications to Convex Minimization

0 references

Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions

0 references

Forward-partial inverse-forward splitting for solving monotone inclusions

0 references

Enlargement of monotone operators with applications to variational inequalities

0 references

Q4252814

0 references

Hybrid approximate proximal method with auxiliary variational inequality for vector optimization

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

Systems of Structured Monotone Inclusions: Duality, Algorithms, and Applications

0 references

Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

0 references

Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme

0 references

A three-operator splitting scheme and its optimization applications

0 references

On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

A practical relative error criterion for augmented Lagrangians

0 references

Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM

0 references

Splitting Methods in Communication, Imaging, Science, and Engineering

0 references

Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework

0 references

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems

0 references

On the proximal point method for equilibrium problems in Hilbert spaces

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Q5852067

0 references

Q5618030

0 references

A first-order block-decomposition method for solving two-easy-block structured semidefinite programs

0 references

Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems

0 references

An adaptive accelerated first-order method for convex optimization

0 references

Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

Q4704621

0 references

An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions

0 references

A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS<sup>*</sup>

0 references

On Weak Convergence of the Douglas–Rachford Method

0 references

A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method

0 references

A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S11075-018-0604-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2322832

@@ Property / DOI @@
-.1007/s11075-018-0604-1
@@ Property / DOI: 10.1007/s11075-018-0604-1 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q129153692
@@ Property / Wikidata QID: Q129153692 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11075-018-0604-1
@@ Property / DOI: 10.1007/S11075-018-0604-1 / rank @@
+Normal rank