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

DOI10.1137/15M1038566MaRDI QIDQ5506692

Renato D. C. Monteiro, M. Marques Alves, Benar Fux Svaiter

Publication date: 13 December 2016

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

hybrid proximal extragradient methodKorpelevich's extragradient methodproximal point methodsergodic iteration complexitypointwise iteration complexityTseng's MFBS method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, 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, On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual extrapolation and its applications to solving variational inequalities and related problems
• Monotone (nonlinear) operators in Hilbert space
• Enlargement of monotone operators with applications to variational inequalities
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• A strongly convergent iterative solution of \(0 \in U(x)\) for a maximal monotone operator U in Hilbert space
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• 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
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers