An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
From MaRDI portal
Publication:4594855
DOI10.1080/10556788.2016.1266355zbMath1375.90236OpenAlexW2565382733MaRDI QIDQ4594855
O. Kolossoski, Renato D. C. Monteiro
Publication date: 24 November 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1266355
complexitymaximal monotone operatorconvex programmingBregman distancessaddle-point problemergodic convergencehybrid proximal extragradient methodaccelerated gradient methodinexact proximal method
Convex programming (90C25) Nonlinear programming (90C30) Monotone operators and generalizations (47H05)
Related Items
Projection-free accelerated method for convex optimization, New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems, Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems, An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems, A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems, An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems, Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games, Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework, Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization, An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems, Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators, A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems, On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM, A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems, Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
