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
From MaRDI portal
Publication:3225247
DOI10.1137/100801652zbMath1245.90155OpenAlexW2084845949WikidataQ105584132 ScholiaQ105584132MaRDI QIDQ3225247
Renato D. C. Monteiro, Benar Fux Svaiter
Publication date: 16 March 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0f5aaa2513a0dfaf6020770416af7dff736245d3
hemivariational inequalitymaximal monotone operatorsaddle pointforward-backward splitting methodsextragradientKorpelevich's method
Numerical mathematical programming methods (65K05) Convex programming (90C25) 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
Nonsmooth dynamical systems: from the existence of solutions to optimal and feedback control, New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems, A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities, Evolutionary quasi-variational-hemivariational inequalities. I: Existence and optimal control, Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems, Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems, The saddle point problem of polynomials, Accelerated schemes for a class of variational inequalities, Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, A first-order block-decomposition method for solving two-easy-block structured semidefinite programs, On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems, Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds, An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization, A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization, On the computation of equilibria in monotone and potential stochastic hierarchical games, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, Golden ratio algorithms for variational inequalities, Extragradient method in optimization: convergence and complexity, Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems, Unnamed Item, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, Tikhonov-like methods with inexact minimization for solving linear ill-posed problems, Proximal extrapolated gradient methods for variational inequalities, A proximal-Newton method for unconstrained convex optimization in Hilbert spaces, An extragradient-based alternating direction method for convex minimization, Extragradient Method with Variance Reduction for Stochastic Variational Inequalities, A golden ratio primal-dual algorithm for structured convex optimization, Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators, Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers, Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods, Modified forward-backward splitting method for variational inclusions, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, A projected extrapolated gradient method with larger step size for monotone variational inequalities, Communication-efficient algorithms for decentralized and stochastic optimization, Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, Saddle points of rational functions, Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration, Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations, 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 Accelerated Linearized Alternating Direction Method of Multipliers, Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
