An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
DOI10.1080/10556788.2016.1266355zbMATH Open1375.90236OpenAlexW2565382733MaRDI QIDQ4594855FDOQ4594855
Authors: O. Kolossoski, Renato D. C. Monteiro 
Publication date: 24 November 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1266355
Recommendations
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- Accelerated methods for saddle-point problem
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- An alternating extragradient method with non Euclidean projections for saddle point problems
- Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems
complexityconvex programmingergodic convergencehybrid proximal extragradient methodmaximal monotone operatorsaddle-point problemBregman distancesaccelerated gradient methodinexact proximal method
Convex programming (90C25) Nonlinear programming (90C30) Monotone operators and generalizations (47H05)
Cited In (23)
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- Projection-free accelerated method for convex optimization
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- An alternating extragradient method with non Euclidean projections for saddle point problems
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Accelerated methods for saddle-point problem
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- Accelerated minimax algorithms flock together
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
This page was built for publication: An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594855)
