On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm

DOI10.1080/02331934.2018.1476860zbMath1484.90074arXiv1711.09959OpenAlexW2964113652MaRDI QIDQ5151507

Samara Costa Lima, M. Marques Alves

Publication date: 19 February 2021

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.09959

zbMATH Keywords

complexityrate of convergencestrongly monotone operatorpartial inverse methodSPDG algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive accelerated first-order method for convex optimization
• A practical relative error criterion for augmented Lagrangians
• A primal-dual method of partial inverses for composite inclusions
• Forward-partial inverse-forward splitting for solving monotone inclusions
• Partial inverse of a monotone operator
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Epsilon-proximal decomposition method
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
• Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS^*
• A survey on operator splitting and decomposition of convex programs
• On the proximal point method for equilibrium problems in Hilbert spaces
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• A Hybrid Proximal-Extragradient Algorithm with Inertial Effects
• An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
• Applications of the method of partial inverses to convex programming: Decomposition
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• An inexact method of partial inverses and a parallel bundle method
• Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm