Pages that link to "Item:Q4594855"
From MaRDI portal
The following pages link to An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems (Q4594855):
Displaying 19 items.
- An alternating extragradient method with non Euclidean projections for saddle point problems (Q480931) (← links)
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators (Q721953) (← links)
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems (Q2044494) (← links)
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization (Q2232754) (← links)
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods (Q2848187) (← links)
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework (Q2968178) (← links)
- A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems (Q4989936) (← links)
- Projection-free accelerated method for convex optimization (Q5038178) (← links)
- New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
- Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems (Q5162651) (← links)
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM (Q5221273) (← links)
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems (Q6097769) (← links)
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games (Q6191973) (← links)
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems (Q6596342) (← links)
- Accelerated minimax algorithms flock together (Q6663115) (← links)
