On the initialization for convex-concave min-max problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerated schemes for a class of variational inequalities
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- Dual extrapolation and its applications to solving variational inequalities and related problems
- Implicit Functions and Solution Mappings
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Optimal primal-dual methods for a class of saddle point problems
- Primal-dual subgradient methods for convex problems
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Robust Stochastic Approximation Approach to Stochastic Programming
- Robust optimization
- Scale-invariant unconstrained online learning
- Smooth minimization of non-smooth functions
- Solving variational inequalities with stochastic mirror-prox algorithm
This page was built for publication: On the initialization for convex-concave min-max problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028757)
