An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
From MaRDI portal
(Redirected from Publication:4594855)
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
Cited in
(27)- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- Extragradient and extrapolation methods with generalized Bregman distances 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
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- 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 alternating extragradient method with non Euclidean projections for saddle point problems
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- 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 Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- 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
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Accelerated minimax algorithms flock together
- A general framework for symmetric and asymmetric variable metric proximal point methods, with relations between relative-errors and summable-errors
- A new primal-dual hybrid gradient scheme for solving minimax problems with nonlinear term
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- VFOSA: variance-reduced fast operator splitting algorithms for generalized equations
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)
